Comparing mixing times on sparse random graphs

zbMath1403.05133arXiv1707.04784MaRDI QIDQ4608002

Eyal Lubetzky, Anna Ben-Hamou, Yuval Peres

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1707.04784

zbMATH Keywords

Galton-Watson treenonbacktracking random walk

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Density (toughness, etc.) (05C42)

Related Items

Cutoff for random lifts of weighted graphs