A. E. Allahverdyan, G. Ver-steeg, and A. Galstyan, Community detection with and without prior information, Europhysics Letters), vol.90, issue.1, p.18002, 2010.

R. Andersen, F. Chung, and K. Lang, Local graph partitioning using PageRank vectors, Proceedings of IEEE FOCS'06, pp.475-486, 2006.

R. Andersen and K. J. Lang, Communities from seed sets, Proceedings of ACM WWW'06, pp.223-232, 2006.

R. Andersen, S. O. Gharan, Y. Peres, and L. Trevisan, Almost optimum local graph clustering using evolving sets, Journal of the ACM (JACM), vol.63, issue.2, p.15, 2016.

K. Avrachenkov, A. Kadavankandy, L. O. Prokhorenkova, and A. Raigorodskii, PageRank in undirected random graphs, vol.13, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01227383

K. Avrachenkov and D. Lebedev, PageRank of scale-free growing networks, Internet Mathematics, vol.3, issue.2, pp.207-231, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070168

K. Avrachenkov and N. Litvak, The effect of new links on Google PageRank. Stochastic Models, vol.22, pp.319-331, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070742

K. Avrachenkov, N. Litvak, and K. S. Pham, Distribution of PageRank mass among principle components of the web, Proceedings of WAW, pp.16-28, 2007.

K. Avrachenkov, N. Litvak, and K. S. Pham, A singular perturbation approach for choosing the PageRank damping factor, Internet Mathematics, vol.5, issue.1-2, pp.47-69, 2008.

S. O. Chan, T. C. Kwok, and L. C. Lau, Random walks and evolving sets: Faster convergences and limitations, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1849-1865, 2017.

N. Chen, N. Litvak, and M. Olvera-cravioto, Generalized PageRank on directed configuration networks, Random Structures & Algorithms, vol.51, issue.2, pp.237-274, 2017.

M. E. Dickison, M. Magnani, and L. Rossi, Multilayer social networks, 2016.

S. Fortunato, M. Boguñá, A. Flammini, and F. Menczer, On local estimations of PageRank: A mean field approach, Internet Mathematics, vol.4, issue.2-3, pp.245-266, 2007.

A. Garavaglia, R. Van-der-hofstad, and N. Litvak, Local weak convergence for PageRank, 2018.

D. Gleich and M. Mahoney, Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow, Proceedings of International Conference on Machine Learning (ICML), pp.1018-1025, 2014.

G. H. Golub and C. F. Van-loan, Matrix computations, 2013.

B. Hajek, Y. Wu, and J. Xu, Recovering a hidden community beyond the spectral limit in O(|E| log * |V |) time, 2015.

B. Hajek, Y. Wu, and J. Xu, Semidefinite programs for exact recovery of a hidden community, Proceedings of COLT'16, pp.1-44, 2016.

A. Halu, R. J. Mondragón, P. Panzarasa, and G. Bianconi, Multiplex pagerank, PloS one, vol.8, issue.10, p.78293, 2013.

T. H. Haveliwala, Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search, IEEE Trans. on Knowledge and Data Engineering, vol.15, issue.4, pp.784-796, 2003.

R. Van-der-hofstad, Random graphs and complex networks, 2016.

P. R. Jelenkovi´cjelenkovi´c and M. Olvera-cravioto, Information ranking and power laws on trees, Advances in Applied Probability, vol.42, issue.4, pp.1057-1093, 2010.

L. G. Jeub, P. Balachandran, M. A. Porter, P. J. Mucha, and M. W. Mahoney, Think locally, act locally: Detection of small, medium-sized, and large communities in large networks, Physical Review E, vol.91, issue.1, p.12821, 2015.

A. Kadavankandy, K. Avrachenkov, L. Cottatellucci, and R. Sundaresan, The power of sideinformation in subgraph detection, IEEE Trans. Signal Processing, vol.66, issue.7, pp.1905-1919, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01936412

A. Kadavankandy, L. Cottatellucci, and K. Avrachenkov, Characterization of L 1-norm statistic for anomaly detection in Erd? os Rényi graphs, Proceedings of IEEE CDC'16, pp.4600-4605, 2016.

I. M. Kloumann, J. Ugander, and J. Kleinberg, Block models and personalized PageRank, Proceedings of the National Academy of Sciences, p.201611275, 2016.

A. N. Langville and C. D. Meyer, Deeper inside pagerank, Internet Mathematics, vol.1, pp.335-380, 2004.

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, vol.6, pp.29-123, 2009.

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

D. A. Spielman and S. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of STOC 2004, pp.81-90, 2004.

D. A. Spielman and S. Teng, A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning, SIAM J. Comput, vol.42, issue.1, pp.1-26, 2013.

Y. Volkovich and N. Litvak, Asymptotic analysis for personalized web search, Advances in Applied Probability, vol.42, issue.2, pp.577-604, 2010.

P. Zhang, C. Moore, and L. Zdeborova, Phase transitions in semisupervised clustering of sparse networks, Physical Review E, vol.90, issue.5, p.52802, 2014.

Z. A. Zhu, S. Lattanzi, and V. S. Mirrokni, A Local Algorithm for Finding Well-Connected Clusters, Proceedings of ICML, vol.3, pp.396-404, 2013.