D. Aldous and J. Fill, Reversible Markov chains and random walks on graphs, 2002.

K. Avrachenkov, P. Chebotarev, and A. Mishenin, Semi-supervised learning with regularized Laplacian, Optimization Methods and Software, vol.32, issue.2, pp.222-236, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01648135

K. Avrachenkov, J. A. Filar, and P. G. Howlett, Analytic perturbation theory and its application, 2013.

K. Avrachenkov, N. Litvak, M. Sokol, and D. Towsley, Quick detection of nodes with large degrees, Internet Mathematics, vol.10, issue.1-2, pp.1-19, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00670278

K. Avrachenkov, B. Ribeiro, and D. Towsley, Improving random walk estimation accuracy with uniform restarts, Proceedings of International Workshop on Algorithms and Models for the Web-Graph, pp.98-109, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00520350

K. Avrachenkov, R. Van-der-hofstad, and M. Sokol, Personalized PageRank with node-dependent restart, Proceedings of International Workshop on Algorithms and Models for the Web-Graph, pp.23-33, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01052482

. Baumgärtel, Analytic perturbation theory for matrices and operators, 1985.

P. Brémaud, Markov chains: Gibbs fields, Monte Carlo simulation, and queues, 1999.

F. Chung, Spectral graph theory, 1997.

T. Haveliwala and S. Kamvar, The second eigenvalue of the Google matrix, 2003.

R. A. Horn and C. R. Johnson, Matrix analysis, 2013.

I. C. Ipsen and T. M. Selee, Ergodicity coefficients defined by vector norms, SIAM Journal on Matrix Analysis and Applications, vol.32, issue.1, pp.153-200, 2011.

K. A. Jacobsen and J. H. Tien, A generalized inverse for graphs with absorption, Linear Algebra and its Applications, vol.537, pp.118-147, 2018.

T. Kato, Perturbation theory for linear operators, 1995.

R. I. Kondor and J. Lafferty, Diffusion kernels on graphs and other discrete input spaces, Proceedings of ICML, pp.315-322, 2002.

A. N. Langville and C. D. Meyer, Google's PageRank and beyond: The science of search engine rankings, 2006.

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2008.

F. Murai, B. Ribeiro, D. Towsley, and P. Wang, Characterizing directed and undirected networks via multidimensional walks with jumps, 2017.

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: Bringing order to the web, 1999.

B. Ribeiro and D. Towsley, Estimating and sampling graphs with multidimensional random walks, Proceedings of the 10th ACM SIGCOMM conference on Internet measurement, pp.390-403, 2010.

E. Seneta, Non-negative matrices and Markov chains. Revised printing edition, 2006.

E. Volz and D. D. Heckathorn, Probability based estimation theory for respondent driven sampling, Journal of Official Statistics, vol.24, issue.1, p.79, 2008.

, Brendan McKay's graph collection

, GitHub code repository for the numerical experiments of the article