COMPARING MIXING TIMES ON SPARSE RANDOM GRAPHS - Laboratoire de Probabilités et Modèles Aléatoires Accéder directement au contenu
Article Dans Une Revue Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques Année : 2019

COMPARING MIXING TIMES ON SPARSE RANDOM GRAPHS

Résumé

It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let G be a random graph on n vertices with minimum degree 3 and a degree distribution that has exponential tails. We determine the precise worst-case mixing time for simple random walk on G, and show that, with high probability, it exhibits cutoff at time h −1 log n, where h is the asymptotic entropy for simple random walk on a Galton–Watson tree that approximates G locally. (Previously this was only known for typical starting points.) Furthermore, we show this asymptotic mixing time is strictly larger than the mixing time of nonbacktracking walk, via a delicate comparison of entropies on the Galton–Watson tree.
Fichier principal
Vignette du fichier
comparing-mixing.pdf (432.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01598912 , version 1 (30-09-2017)

Identifiants

Citer

Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres. COMPARING MIXING TIMES ON SPARSE RANDOM GRAPHS. Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques, 2019, ⟨10.1214/18-AIHP911⟩. ⟨hal-01598912⟩
190 Consultations
194 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More