D. Aldous and J. Fill, Reversible Markov chains and random walks on graphs URL https, 2002.
DOI : 10.1007/bf01048272

I. Benjamini and B. Morris, The birthday problem and markov chain monte carlo. arXiv preprint math, 2007.

I. Benjamini, G. Kozma, L. Lovász, D. Romik, and G. Tardos, Waiting for a Bat to Fly By (in Polynomial Time), Combinatorics, Probability and Computing, vol.15, issue.05, pp.673-683, 2006.
DOI : 10.1017/S0963548306007590

B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980.
DOI : 10.1016/S0195-6698(80)80030-8

A. Broder and E. Shamir, On the second eigenvalue of random regular graphs, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.286-294, 1987.
DOI : 10.1109/SFCS.1987.45

J. Bunge and M. Fitzpatrick, Estimating the number of species: a review, Journal of the American Statistical Association, vol.88, issue.421, pp.364-373, 1993.

C. Cooper, T. Radzik, and Y. Siantos, Estimating network parameters using random walks. Social Network Analysis and Mining, p.168, 2014.
DOI : 10.1109/cason.2012.6412374

A. D. Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali, Distributed random walks, J. ACM, vol.602, issue.1, pp.1-2, 2013.

D. J. Hsu, A. Kontorovich, and C. Szepesvári, Mixing time estimation in reversible markov chains from a single sample path, Advances in neural information processing systems, pp.1459-1467, 2015.

S. Janson, The Probability That a Random Multigraph is Simple, Combinatorics, Probability and Computing, vol.19, issue.1-2, pp.205-225, 2009.
DOI : 10.1017/CBO9780511814068

L. Katzir, E. Liberty, O. Somekh, and I. A. Cosma, Estimating sizes of social networks via biased sampling, Internet Mathematics, vol.10, pp.3-4335, 2014.

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, Internet Mathematics, vol.6, issue.1, pp.29-123, 2009.
DOI : 10.1080/15427951.2009.10129177

D. A. Levin and Y. Peres, Estimating the spectral gap of a reversible markov chain from a short trajectory, 2016.

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2009.
DOI : 10.1090/mbk/058

E. Lubetzky and A. Sly, 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
URL : http://arxiv.org/pdf/0812.0060

R. Lyons, Asymptotic Enumeration of Spanning Trees, Combinatorics, Probability and Computing, vol.14, issue.4, pp.491-522, 2005.
DOI : 10.1017/S096354830500684X

Y. Peres, T. Sauerwald, P. Sousi, and A. Stauffer, Intersection and mixing times for reversible chains, Electronic Journal of Probability, vol.22, issue.0, 2017.
DOI : 10.1214/16-EJP18
URL : http://doi.org/10.1214/16-ejp18

A. Ben-hamou, I. Estrada, and D. Castorina, Rio de Janeiro 22460-320, Brazil. E-mail address: benhamou@impa.br R Rio de Janeiro 22460-320, Brazil. E-mail address: rimfo@impa.br Y. Peres Microsoft Research, One Microsoft Way, vol.110, issue.110