R. Andersen, F. Chung, L. , and K. , Local Graph Partitioning using PageRank Vectors, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006.
DOI : 10.1109/FOCS.2006.44

A. Athreya, C. E. Priebe, M. Tang, V. Lyzinski, D. J. Marchette et al., A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs, Sankhya A, vol.100, issue.3, pp.1-18, 2013.
DOI : 10.1007/978-3-540-77004-6_11

K. Avrachenkov, L. Cottatellucci, and A. Kadavankandy, Spectral properties of random matrices for stochastic block model, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2015.
DOI : 10.1109/WIOPT.2015.7151116

URL : https://hal.archives-ouvertes.fr/hal-01261156

K. Avrachenkov, V. Dobrynin, D. Nemirovsky, S. K. Pham, and E. Smirnova, Pagerank based clustering of hypertext document collections, Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '08, pp.873-874, 2008.
DOI : 10.1145/1390334.1390549

URL : https://hal.archives-ouvertes.fr/inria-00565355

K. Avrachenkov, P. Gonçalves, A. Mishenin, and M. Sokol, Generalized Optimization Framework for Graph-based Semi-supervised Learning, Proceedings of SIAM Conference on Data Mining, 2012.
DOI : 10.1137/1.9781611972825.83

URL : https://hal.archives-ouvertes.fr/inria-00633818

K. Avrachenkov and D. Lebedev, PageRank of Scale-Free Growing Networks, Internet Mathematics, vol.3, issue.2, pp.207-231, 2006.
DOI : 10.1080/15427951.2006.10129120

URL : https://hal.archives-ouvertes.fr/inria-00070168

R. Bhatia, Matrix analysis, Science and Business Media, 2013.
DOI : 10.1007/978-1-4612-0653-8

P. Billingsley, Probability and measure, 2008.

F. Boudin, A comparison of centrality measures for graph-based keyphrase extraction, Proceedings of the International Joint Conference on Natural Language Processing (IJCNLP), 2013.
URL : https://hal.archives-ouvertes.fr/hal-00850187

N. Chen, N. Litvak, and M. Olvera-cravioto, PageRank in Scale-Free Random Graphs, Proceedings of WAW, 2014.
DOI : 10.1007/978-3-319-13123-8_10

N. Chen, N. Litvak, and M. Olvera-cravioto, Generalized PageRank on directed configuration networks. Random Structures & Algorithms, 2016.
DOI : 10.1002/rsa.20700

F. Chung, A local graph partitioning algorithm using heat kernel PageRank, Proceedings of WAW, 2009.
DOI : 10.1007/978-3-540-95995-3_6

URL : http://www.math.ucsd.edu/~fan/wp/kernel_local.pdf

F. Chung, Spectral graph theory, p.92, 1997.
DOI : 10.1090/cbms/092

F. Chung, L. , and L. , The average distances in random graphs with given expected degrees, pp.99-15879, 2002.

F. Chung, L. Lu, and V. Vu, Spectra of random graphs with given expected degrees, pp.6313-6318, 2003.

F. Chung, R. , and M. , On the spectra of general random graphs. The electronic journal of combinatorics, 2011.

A. Condon and R. Karp, Algorithms for graph partitioning on the planted partition model, Random Structures and Algorithms, p.116140, 2001.

C. Ding, X. He, P. Husbands, H. Zha, H. D. Simon et al., HITS and a unified framework for link analysis, Proceedings of ACM SIGIR, 2002.
DOI : 10.1137/1.9781611972733.24

P. Erd?-os and A. Rényi, On random graphs, Publicationes Mathematicae Debrecen , v, vol.6, pp.290-297, 1959.

S. Fortunato, M. Boguna, A. Flammini, and F. Menczer, Approximating PageRank from In-Degree, Proceedings of WAW, 2008.
DOI : 10.1007/978-3-540-78808-9_6

D. Gkorou, T. Vinko, J. Pouwelse, and D. Epema, Leveraging node properties in random walks for robust reputations in decentralized networks, IEEE P2P 2013 Proceedings, 2013.
DOI : 10.1109/P2P.2013.6688708

T. H. Haveliwala, Topic-sensitive PageRank, Proceedings of the eleventh international conference on World Wide Web , WWW '02, pp.517-526, 2002.
DOI : 10.1145/511446.511513

URL : http://www-db.stanford.edu/~taherh/papers/topic-sensitive-pagerank.ps

S. Heimlicher, M. Lelarge, and L. Massoulié, Community detection in the labelled stochastic block model. arXiv preprint arXiv:1209, p.2910, 2012.

P. W. Holland, S. Kathryn-blackmond-laskey, and . Leinhardt, Stochastic blockmodels: First steps, Social networks 5, pp.109-137, 1983.
DOI : 10.1016/0378-8733(83)90021-7

R. A. Horn, J. , and C. , Matrix analysis, 2012.

S. D. Kamvar, M. T. Schlosser, H. Garcia-molina, and H. , The Eigentrust algorithm for reputation management in P2P networks, Proceedings of the twelfth international conference on World Wide Web , WWW '03, 2003.
DOI : 10.1145/775152.775242

B. Karrer and M. E. Newman, Stochastic blockmodels and community structure in networks, Physical Review E, vol.33, issue.1, p.16107, 2011.
DOI : 10.1088/1742-5468/2006/11/P11010

A. N. Langville, M. , and C. D. , Deeper Inside PageRank, Internet Mathematics, vol.1, issue.3, pp.335-380, 2004.
DOI : 10.1080/15427951.2004.10129091

N. Litvak, W. R. Scheinhardt, and Y. Volkovich, In-degree and PageRank: Why do they follow similar power laws? Internet mathematics, pp.175-198, 2007.
DOI : 10.1080/15427951.2007.10129293

URL : http://wwwhome.math.utwente.nl/%7Evolkovichyv/InDegreePageRank.pdf

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

N. Perra and S. Fortunato, Spectral centrality measures in complex networks, Physical Review E, vol.30, issue.3, p.36107, 2008.
DOI : 10.1007/BF02289527

K. Rohe, S. Chatterjee, and B. Yu, Spectral clustering and the high-dimensional stochastic blockmodel, The Annals of Statistics, vol.39, issue.4, pp.1878-1915, 2011.
DOI : 10.1214/11-AOS887

J. A. Tropp, User-friendly tail bounds for sums of random matrices. Foundations of computational mathematics 12, pp.389-434, 2012.

S. Vadhan and . Pseudorandomness, Foundations and Trends in Theoretical Computer Science, pp.1-336, 2012.

Y. Volkovich and N. Litvak, Asymptotic analysis for personalized Web search, Advances in Applied Probability, vol.14, issue.02, pp.577-604, 2010.
DOI : 10.1145/324133.324140

URL : https://ris.utwente.nl/ws/files/5099793/memo1884.pdf

E. Yeh, D. Ramage, C. D. Manning, E. Agirre, and A. Soroa, WikiWalk, Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing, TextGraphs-4, 2009.
DOI : 10.3115/1708124.1708133

Y. Zhao, E. Levina, and J. Zhu, Consistency of community detection in networks under degree-corrected stochastic block models, The Annals of Statistics, vol.40, issue.4, pp.2266-2292, 2012.
DOI : 10.1214/12-AOS1036SUPP