Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains
From MaRDI portal
Publication:4289296
DOI10.1017/S0963548300000699zbMATH Open0793.60078MaRDI QIDQ4289296FDOQ4289296
Authors: Salvatore Ingrassia
Publication date: 24 May 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-negative matrices and Markov chains.
- Title not available (Why is that?)
- Geometric bounds for eigenvalues of Markov chains
- Strong uniform times and finite random walks
- A Markov chain on the symmetric group and Jack symmetric functions
- Approximate counting, uniform generation and rapidly mixing Markov chains
- On an inequality of Chernoff
- A note on an inequality involving the normal distribution
- On upper and lower bounds for the variance of a function of a random variable
- Finite Continuous Time Markov Chains
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Bounds for eigenvalues of certain stochastic matrices
- Random walks on graphs, electric networks and fractals
- Poincaré-type inequalities via stochastic integrals
- A generalization of Chernoff inequality via stochastic analysis
- Bounds for eigenvalues of doubly stochastic matrices
- Transportation in graphs and the admittance spectrum
Cited In (10)
- Estimation of spectral gap for Markov chains
- Efficient Markovian couplings: Examples and counterexamples.
- Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
- Bounding spectral gaps of Markov chains: a novel exact multi-decomposition technique
- Efficient Markovian couplings: Examples and counterexamples
- On spectral gap estimates of a Markov chain via hitting times and coupling
- Three kinds of geometric convergence for Markov chains and the spectral gap property
- Mixing time estimation in reversible Markov chains from a single sample path
- The smallest eigenvalue for reversible Markov chains
- Estimating the spectral gap of a trace-class Markov operator
This page was built for publication: Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289296)