Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
From MaRDI portal
Publication:1296583
DOI10.1214/AOAP/1029962594zbMATH Open0935.60057OpenAlexW2060191528MaRDI QIDQ1296583FDOQ1296583
Jason Fulman, Elizabeth L. Wilmer
Publication date: 25 April 2000
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1029962594
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenvalues and expanders
- Generating a random permutation with random transpositions
- Title not available (Why is that?)
- Isoperimetric Inequalities in Mathematical Physics. (AM-27)
- Geometric bounds for eigenvalues of Markov chains
- Ramanujan graphs
- On the maximum degree in a random tree
- Approximating the Permanent
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Moderate growth and random walk on finite groups
- Title not available (Why is that?)
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
- Title not available (Why is that?)
Cited In (5)
Recommendations
This page was built for publication: Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296583)