A threshold for cutoff in two-community random graphs
From MaRDI portal
Publication:2657925
DOI10.1214/19-AAP1544zbMath1472.60117arXiv1809.07243OpenAlexW3047142522MaRDI QIDQ2657925
Publication date: 18 March 2021
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07243
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)
Related Items
Universality of cutoff for graphs with an added random matching, Linking the mixing times of random walks on static and dynamic random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- Mixing and hitting times for finite Markov chains
- Mixing times are hitting times of large sets
- Explicit expanders with cutoff phenomena
- Universality of cutoff for the Ising model
- Cutoff phenomena for random walks on random regular graphs
- Mixing times of random walks on dynamic configuration models
- Mesoscopic scales in hierarchical configuration models
- Random walks on the random graph
- Characterization of cutoff for reversible Markov chains
- Cutoff for nonbacktracking random walks on sparse random graphs
- Random walks on dynamic configuration models: a trichotomy
- Stein's method for concentration inequalities
- Random walk on sparse random digraphs
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- The mixing time of the giant component of a random graph
- Negative dependence and the geometry of polynomials
- Tight inequalities among set hitting times in Markov chains
- Generating a random permutation with random transpositions
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- A technical report on hitting times, mixing and cutoff
- Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures
