Geometric bounds on the fastest mixing Markov chain
DOI10.1007/s00440-023-01257-xarXiv2111.05816OpenAlexW3214447922WikidataQ129148458 ScholiaQ129148458MaRDI QIDQ6193769
No author found.
Publication date: 19 March 2024
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.05816
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Continuous-time Markov processes on discrete state spaces (60J27) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Comparison inequalities and fastest-mixing Markov chains
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Trailing the dovetail shuffle to its lair
- An asymptotic isoperimetric inequality
- Relations between isoperimetry and spectral gap for finite Markov chains
- The electrical resistance of a graph captures its commute and cover times
- Moments of first hitting times for birth-death processes on trees
- Bounding fastest mixing
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Graph expansion and the unique games conjecture
- Fastest Mixing Reversible Markov Chains on Graphs With Degree Proportional Stationary Distributions
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Fastest mixing Markov chain problem for the union of two cliques
- Polynomial-Time Approximation Algorithms for the Ising Model
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Approximating the Permanent
- Extensions of Lipschitz mappings into a Hilbert space
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Fastest Mixing Markov Chain on Graphs with Symmetries
- Generating a random permutation with random transpositions
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
- Fastest Mixing Markov Chain on a Graph
- Twice-Ramanujan Sparsifiers
- Counting Weighted Independent Sets beyond the Permanent
- Counting Perfect Matchings and the Switch Chain
- Tight Bounds for Rumor Spreading with Vertex Expansion
- Fastest Mixing Markov Chain on a Path
- Symmetry Analysis of Reversible Markov Chains
- \(\lambda_{\infty}\), vertex isoperimetry and concentration
This page was built for publication: Geometric bounds on the fastest mixing Markov chain
