, Diameter and stationary distribution of random r-out digraphs. ArXiv e-prints, 2015.
, Random walks on finite groups and rapidly mixing markov chains, Seminar on probability, XVII, pp.243-297, 1983.
DOI : 10.1214/aop/1176994578
, Shuffling Cards and Stopping Times, The American Mathematical Monthly, vol.93, issue.5, pp.333-348, 1986.
DOI : 10.2307/2323590
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.239
, Moments, continuité, et analyse multifractale des martingales de Mandelbrot. Probab. Theory Related Fields, pp.535-569, 1999.
DOI : 10.1007/s004400050217
, Mandelbrot cascades and related topics In Geometry and analysis of fractals, Math. Stat, vol.88, pp.1-45, 2014.
, Cutoff for non-backtracking random walks on sparse random graphs. ArXiv e-prints, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01141192
, The mixing time of the giant component of a random graph, Random Structures & Algorithms, vol.27, issue.3, pp.383-407, 2014.
DOI : 10.1002/rsa.20539
, Random walks on the random graph ArXiv e-prints, 2015.
, Almost sure weak convergence of random probability measures, Stochastics An International Journal of Probability and Stochastic Processes, vol.6, issue.2, pp.91-97, 2006.
DOI : 10.1214/aos/1051027881
, Stein's method for concentration inequalities. Probability theory and related fields, pp.305-321, 2007.
, The Cutoff Phenomenon for Ergodic Markov Processes, Electronic Journal of Probability, vol.13, issue.0, pp.26-78, 2008.
DOI : 10.1214/EJP.v13-474
, PageRank in Scale-Free Random Graphs, Algorithms and models for the web graph, pp.120-131, 2014.
DOI : 10.1007/978-3-319-13123-8_10
, Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful, Structural Information and Communication Complexity, pp.1-14, 2011.
DOI : 10.1007/s00453-003-1030-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.2069
, The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence, Combinatorics, Probability and Computing, vol.13, issue.3, pp.319-337, 2004.
DOI : 10.1017/S096354830400611X
, The Cover Time of Random Regular Graphs, SIAM Journal on Discrete Mathematics, vol.18, issue.4, pp.728-740, 2005.
DOI : 10.1137/S0895480103428478
, The cover time of sparse random graphs. Random Structures Algorithms, pp.1-16, 2007.
, The cover time of the preferential attachment graph, Journal of Combinatorial Theory, Series B, vol.97, issue.2, pp.269-290, 2007.
DOI : 10.1016/j.jctb.2006.05.007
, The cover time of the giant component of a random graph, Random Structures and Algorithms, vol.38, issue.3, pp.401-439, 2008.
DOI : 10.1002/rsa.20201
, Stationary distribution and cover time of random walks on random digraphs, Journal of Combinatorial Theory, Series B, vol.102, issue.2, pp.329-362, 2012.
DOI : 10.1016/j.jctb.2011.11.001
, Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk, SIAM Journal on Discrete Mathematics, vol.30, issue.1, 2014.
DOI : 10.1137/14097937X
URL : http://arxiv.org/abs/1404.4403
, The cutoff phenomenon in finite Markov chains., Proceedings of the National Academy of Sciences, vol.93, issue.4, pp.1659-1664, 1996.
DOI : 10.1073/pnas.93.4.1659
, Asymptotic analysis of a random walk on a hypercube with many dimensions, Random Structures and Algorithms, vol.76, issue.1, pp.51-72, 1990.
DOI : 10.1002/rsa.3240010105
, Generating a random permutation with random transpositions . Probability Theory and Related Fields, pp.159-179, 1981.
, Mixing time of near-critical random graphs, The Annals of Probability, vol.40, issue.3, pp.979-1008, 2012.
DOI : 10.1214/11-AOP647
, The evolution of the mixing rate of a simple random walk on the giant component of a random graph, Random Structures and Algorithms, vol.67, issue.1, pp.68-86, 2008.
DOI : 10.1002/rsa.20210
, On tail probabilities for martingales. The Annals of Probability, pp.100-118, 1975.
, The Cutoff profile for the Simple-Exclusion process on the circle. ArXiv e-prints, 2015.
, Markov chains and mixing times, 2009.
DOI : 10.1090/mbk/058
, The growth of an entire characteristic function and the tail probabilities of the limit of a tree martingale, Trees (Versailles, pp.51-80, 1995.
, Sur Une ??quation Fonctionnelle Et SES Applications: Une Extension Du Th??or??me De Kesten-Stigum Concernant Des Processus De Branchement, Advances in Applied Probability, vol.24, issue.02, pp.353-373, 1997.
DOI : 10.1214/aop/1176989921
, On generalized multiplicative cascades, Stochastic Processes and their Applications, vol.86, issue.2, pp.263-286, 2000.
DOI : 10.1016/S0304-4149(99)00097-6
, Asymptotic properties and absolute continuity of laws stable by random weighted mean. Stochastic Process, Appl, vol.95, issue.1, pp.83-107, 2001.
, Cutoff on all Ramanujan graphs. ArXiv e-prints, 2015.
, Cutoff phenomena for random walks on random regular graphs, Duke Mathematical Journal, vol.153, issue.3, pp.475-510, 2010.
DOI : 10.1215/00127094-2010-029
, Concentration, Probabilistic methods for algorithmic discrete mathematics, pp.195-248, 1998.
DOI : 10.1007/978-3-662-12788-9_6
, Critical random graphs: Diameter and mixing time, The Annals of Probability, vol.36, issue.4, pp.1267-1286, 2008.
DOI : 10.1214/07-AOP358
URL : http://arxiv.org/abs/math/0701316
, A fixed point theorem for distributions. Stochastic Process, Appl, vol.42, issue.2, pp.195-214, 1992.
, Random Walks on Finite Groups, Probability on discrete structures, pp.263-346, 2004.
DOI : 10.1007/978-3-662-09444-0_5
, Optimal transport, of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences, 2009.
DOI : 10.1007/978-3-540-71050-9
URL : https://hal.archives-ouvertes.fr/hal-00974787