Cutoff for nonbacktracking random walks on sparse random graphs
From MaRDI portal
Publication:2012250
DOI10.1214/16-AOP1100zbMath1372.60101arXiv1504.02429OpenAlexW2964318841MaRDI QIDQ2012250
Publication date: 28 July 2017
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02429
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)
Related Items (26)
Universality of cutoff for graphs with an added random matching ⋮ Cutoff for random lifts of weighted graphs ⋮ Complex networks: structure and functionality ⋮ Mixing times of random walks on dynamic configuration models ⋮ An entropic proof of cutoff on Ramanujan graphs ⋮ A threshold for cutoff in two-community random graphs ⋮ Random walk on sparse random digraphs ⋮ CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS ⋮ Mixing time of PageRank surfers on sparse random digraphs ⋮ Speeding up random walk mixing by starting from a uniform vertex ⋮ Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022 ⋮ Cutoff profile of the metropolis biased card shuffling ⋮ Cutoff for permuted Markov chains ⋮ Correlation Bounds for Distant Parts of Factor of IID Processes ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ The degree-wise effect of a second step for a random walk on a graph ⋮ Cutoff at the ``entropic time for sparse Markov chains ⋮ Random walks on the random graph ⋮ The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise ⋮ Random walks on dynamic configuration models: a trichotomy ⋮ Mixing time trichotomy in regenerating dynamic digraphs ⋮ Reversibility of the non-backtracking random walk ⋮ Limit profiles for reversible Markov chains ⋮ Comparing mixing times on sparse random graphs ⋮ Harmonic measure for biased random walk in a supercritical Galton-Watson tree ⋮ Linking the mixing times of random walks on static and dynamic random graphs
This page was built for publication: Cutoff for nonbacktracking random walks on sparse random graphs
