Random walk on sparse random digraphs
- 5 August 2017
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 170 (3-4) , 933-960
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Agence Nationale de la Recherche (FR) (ANR-14-CE25-0014)
- Agence Nationale de la Recherche (ANR-16-CE40-0024-01)
This publication has 29 references indexed in Scilit:
- Mixing time of near-critical random graphsThe Annals of Probability, 2012
- Critical random graphs: Diameter and mixing timeThe Annals of Probability, 2008
- The evolution of the mixing rate of a simple random walk on the giant component of a random graphRandom Structures & Algorithms, 2008
- The cover time of the giant component of a random graphRandom Structures & Algorithms, 2008
- The cover time of sparse random graphsRandom Structures & Algorithms, 2006
- Stein’s method for concentration inequalitiesProbability Theory and Related Fields, 2006
- Moments, continuité, et analyse multifractale des martingales de MandelbrotProbability Theory and Related Fields, 1999
- Sur Une Équation Fonctionnelle Et SES Applications: Une Extension Du Théorème De Kesten-Stigum Concernant Des Processus De BranchementAdvances in Applied Probability, 1997
- Random walks on finite groups and rapidly mixing markov chains1983
- On Tail Probabilities for MartingalesThe Annals of Probability, 1975