Random walks and diffusion on networks

Physics Reports

Volumn 716-717, Issue , 2017, Pages 1-58

  Masuda, Naoki ^a   Porter, Mason A ^b,c   Lambiotte, Renaud ^c  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Diffusion; Markov chain; Network; Point process; Random walk

Indexed keywords

EID: 85054407686     PISSN: 03701573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physrep.2017.07.007     Document Type: Review

References (425)

1. D. Aldous, J.A. Fill, Reversible Markov chains and random walks on graphs, unfinished monograph, recompiled 2014, 2002, available at http://www.stat.berkeley.edu/~aldous/RWG/book.html.
2. Feller, W., An Introduction to Probability Theory and its Applications, Volume I. third ed., 1968, John Wiley & Sons, Hoboken, NJ, USA.
3. Feller, W., An Introduction to Probability Theory and its Applications, Volume II. second ed., 1971, John Wiley & Sons, Hoboken, NJ, USA.
4. Hughes, B.D., Random Walks and Randon Environments, Volume 1: Random Walks. 1995, Oxford University Press, Oxford, UK.
5. Kutner, R., Masoliver, J., The continuous time random walk, still trendy: Fifty-year history, state of art, and outlook. Eur. Phys. J. B, 90, 2017, 50.
6. Pearson, K., The problem of the random walk. Nature, 72, 1905, 294.
7. Ore, O., Pascal and the invention of probability theory. Amer. Math. Monthly 67 (1960), 409–419.
8. Einstein, A., Über die von der molekularkinetischen Theorie der Wärme geforderte Bewegung von in ruhenden Flüssigkeiten suspendierten Teilchen. Ann. Phys. 322 (1905), 549–560.
9. Viswanathan, G.M., Buldyrev, S.V., Havlin, S., da Luz, M.G.E., Raposo, E.P., Stanley, H.E., Optimizing the success of random searches. Nature 401 (1999), 911–914.
10. Codling, E.A., Plank, M.J., Benhamou, S., Random walk models in biology. J. R. Soc. Interface 5 (2008), 813–834.
11. Humphries et al., N.E., Environmental context explains Lévy and Brownian movement patterns of marine predators. Nature 465 (2010), 1066–1069, 10.1038/nature09116.
12. Okubo, A., Levin, S.A., Diffusion and Ecological Problems: Modern Perspectives. second ed., 2001, Springer, New York, NY, USA.
13. Tuckwell, H.C., Introduction to Theoretical Neurobiology: Volume 2, Nonlinear and Stochastic Theories. 1988, Cambridge University Press, Cambridge, UK.
14. Gabbiani, F., Cox, S.J., Mathematics for Neuroscientists. 2010, Academic Press, Amsterdam, The Netherlands.
15. Usher, M., McClelland, J.L., The time course of perceptual choice: The leaky, competing accumulator model. Psychol. Rev. 108 (2001), 550–592.
16. Gold, J.I., Shadlen, M.N., The neural basis of decision making. Annu. Rev. Neurosci. 30 (2007), 535–574.
17. Ewens, W.J., Mathematical Population Genetics I. Theoretical Introduction. 2010, Springer, New York, NY, USA.
18. Fisher, M.E., Shape of a self-avoiding walk or polymer chain. J. Chem. Phys. 44 (1966), 616–622.
19. Isichenko, M.B., Percolation, statistical topography, and transport in random media. Rev. Modern Phys. 64 (1992), 961–1043.
20. Campbell, J.Y., Lo, A.W., MacKinlay, A.C., The Econometrics of Financial Markets. 1996, Princeton University Press, Princeton, NJ, USA.
21. Mantegna, R.N., Stanley, H.E., An Introduction to Econophysics. 1999, Cambridge University Press, Cambridge, UK.
22. Jia, Tao, Wang, Dashun, Szymanski, Boleslaw K., Quantifying patterns of research-interest evolution. Nat. Human Behav., 1, 2017, 0078.
23. Gleich, D.F., PageRank beyond the Web. SIAM Rev. 57 (2015), 321–363.
24. Coifman, R.R., Lafon, S., Lee, A.B., Maggioni, M., Nadler, B., Warner, F., Zucker, S.W., Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. Proc. Natl. Acad. Sci. USA 102 (2005), 7426–7431.
25. Coifman, R.R., Lafon, S., Diffusion maps. Appl. Comput. Harmon. Anal. 21 (2006), 5–30.
26. Clauset, A., Kogan, M., Redner, S., Safe leads and lead changes in competitive team sports. Phys. Rev. E, 91, 2015, 062815.
27. Godrèche, C., Majumdar, S.N., Schehr, G., Record statistics of a strongly correlated time series: Random walks and Lévy flights. J. Phys. A, 50, 2017, 333001.
28. Iannelli, F., Koher, A., Brockmann, D., Hövel, P., Sokolov, I.M., Effective distances for epidemics spreading on complex networks. Phys. Rev. E, 95, 2017, 012313.
29. Spitzer, F., Principles of Random Walk. second ed., 1976, Springer, New York, NY, USA.
30. Weiss, G.H., Aspects and Applications of the Random Walk. 1994, North-Holland, Amsterdam, The Netherlands.
31. Redner, S., A Guide to First-Passage Processes. 2001, Cambridge University Press, Cambridge, UK.
32. Burioni, R., Cassi, D., Random walks on graphs: Ideas, techniques and results. J. Phys. A 38 (2005), R45–R78.
33. Krapivsky, P.L., Redner, S., Ben-Naim, E., A Kinetic View of Statistical Physics. 2010, Cambridge University Press, Cambridge, UK.
34. Klafter, J., Sokolov, I.M., First Steps in Random Walks. 2011, Oxford University Press, Oxford, UK.
35. Ibe, O.C., Elements of Random Walk and Diffusion Processes. 2013, Wiley, Hoboken, NJ, USA.
36. Rammal, R., Random-walk statistics on fractal structures. J. Stat. Phys. 36 (1984), 547–560.
37. Havlin, S., ben-Avraham, D., Diffusion in disordered media. Adv. Phys. 36 (1987), 695–798.
38. Bouchaud, J.P., Georges, A., Anomalous diffusion in disordered media: Statistical mechanisms, models and physical applications. Phys. Rep. 195 (1990), 127–293.
39. ben-Avraham, D., Havlin, S., Diffusion and Reactions in Fractals and Disordered Systems. 2000, Cambridge University Press, Cambridge, UK.
40. Bénichou, O., Voituriez, R., From first-passage times of random walks in confinement to geometry-controlled kinetics. Phys. Rep. 539 (2014), 225–284.
41. Doyle, P.G., Snell, J.L., Random Walks and Electric Networks. 1984, Mathematical Association of America, Washington, DC, USA.
42. Lovász, L., Random walks on graphs: A survey. Miklós, D., Sós, V.T., Szőnyi, T., (eds.) Combinatorics, Paul Erdős Is Eighty, Volume 1, 1993, János Bolyai Math. Soc., Budapest, Hungary, 353–398.
43. Porter, M.A., Bianconi, G., Editorial: Network analysis and modelling: Special issue of European Journal of Applied Mathematics. Eur. J. Appl. Math. 27 (2016), 807–811.
44. Newman, M.E.J., Networks: An Introduction. 2010, Oxford University Press, Oxford, UK.
45. Barabási, A.L., Network Science. 2016, Cambridge University Press, Cambridge, UK.
46. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U., Complex networks: structure and dynamics. Phys. Rep. 424 (2006), 175–308.
47. Strogatz, S.H., Exploring complex networks. Nature 410 (2001), 268–276.
48. Barrat, A., Barthélemy, M., Vespignani, A., Dynamical Processes on Complex Networks. 2008, Cambridge University Press, Cambridge, UK.
49. Porter, M.A., Gleeson, J.P., Dynamical Systems on Networks: A Tutorial. 2016, Springer, Heidelberg, Germany.
50. Dorogovtsev, S.N., Mendes, J.F.F., Evolution of Networks: From Biological Nets to the Internet and WWW. 2003, Oxford University Press, Oxford, UK.
51. Cohen, R., Havlin, S., Complex Networks: Structure, Robustness and Function. 2010, Cambridge University Press, Cambridge, UK.
52. Estrada, E., The Structure of Complex Networks: Theory and Applications. 2012, Oxford University Press, Oxford, UK.
53. Newman, M.E.J., The structure and function of complex networks. SIAM Rev. 45 (2003), 167–256.
54. Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y., Zhou, C., Synchronization in complex networks. Phys. Rep. 469 (2008), 93–153.
55. Albert, R., Barabási, A.L., Statistical mechanics of complex networks. Rev. Modern Phys. 74 (2002), 47–97.
56. Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F., Critical phenomena in complex networks. Rev. Modern Phys. 80 (2008), 1275–1335.
57. Holme, P., Saramäki, J., Temporal networks. Phys. Rep. 519 (2012), 97–125.
58. Holme, P., Modern temporal network theory: A colloquium. Eur. Phys. J. B, 88, 2015, 234.
59. Masuda, N., Lambiotte, R., A Guide to Temporal Networks. 2016, World Scientific, London, UK.
60. Boccaletti, S., Bianconi, G., Criado, R., del Genio, C.I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., Zanin, M., The structure and dynamics of multilayer networks. Phys. Rep. 544 (2014), 1–122.
61. Kivelä, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., Porter, M.A., Multilayer Networks. J. Comput. Netw. 2 (2014), 203–271.
62. De Domenico, M., Granell, C., Porter, M.A., Arenas, A., The physics of spreading processes in multilayer networks. Nat. Phys. 12 (2016), 901–906.
63. M.A. Porter, J.P. Onnela, P.J. Mucha, Communities in networks, Notices Amer. Math. Soc. 56 (2009) 1082–1097, 1164–1166.
64. Fortunato, S., Community detection in graphs. Phys. Rep. 486 (2010), 75–174.
65. Fortunato, S., Hric, D., Community detection in networks: A user guide. Phys. Rep. 659 (2016), 1–44.
66. S. Brin, L. Page, Anatomy of a large-scale hypertextual web search engine, in: Proceedings of the Seventh International World Wide Web Conference, 1998, pp. 107–117.
67. Bonacich, P., Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol. 2 (1972), 113–120.
68. Jeub, L.G.S., Balachandran, P., Porter, M.A., Mucha, P.J., Mahoney, M.W., Think locally, act locally: Detection of small, medium-sized, and large communities in large networks. Phys. Rev. E, 91, 2015, 012821.
69. Gillis, J., Correlated random walk. Math. Proc. Cambridge Philos. Soc. 51 (1955), 639–651.
70. Domb, C., From random to self-avoiding walks. J. Stat. Phys. 30 (1983), 425–436.
71. Madras, N., Slade, G., The Self-Avoiding Walk, 1993, Birkhäuser, Boston, MA, USA.
72. Evans, M.R., Hanney, T., Nonequilibrium statistical mechanics of the zero-range process and related models. J. Phys. A 38 (2005), R195–R240.
73. Schenzle, A., Brand, H., Multiplicative stochastic processes in statistical physics. Phys. Rev. A 20 (1979), 1628–1647.
74. Havlin, S., Selinger, R.B., Schwartz, M., Stanley, H.E., Bunde, A., Random multiplicative processes and transport in structures with correlated spatial disorder. Phys. Rev. Lett. 61 (1988), 1438–1441.
75. Pemantle, R., A survey of random processes with reinforcement. Probab. Surv. 4 (2007), 1–79.
76. Schinazi, R.B., Classical and Spatial Stochastic Processes. 1999, Birkhäuser, Boston, MA, USA.
77. Schütz, G.M., Trimper, S., Elephants can always remember: Exact long-range memory effects in a non-Markovian random walk. Phys. Rev. E, 70, 2004, 045101(R), 10.1103/PhysRevE.70.045101.
78. Kempe, J., Quantum random walks: An introductory overview. Contemp. Phys. 44 (2003), 307–327.
79. Mülken, O., Blumen, A., Continuous-time quantum walks: Models for coherent transport on complex networks. Phys. Rep. 502 (2011), 37–87.
80. Bénichou, O., Loverdo, C., Moreau, M., Voituriez, R., Intermittent search strategies. Rev. Modern Phys. 83 (2011), 81–130, 10.1103/RevModPhys.83.81.
81. Tejedor, V., Voituriez, R., Bénichou, O., Optimizing persistent random searches. Phys. Rev. Lett., 108, 2012, 088103.
82. Bénichou, O., Redner, S., Depletion-controlled starvation of a diffusing forager. Phys. Rev. Lett., 113, 2014, 238101.
83. Bénichou, O., Chupeau, M., Redner, S., Role of depletion on the dynamics of a diffusing forager. J. Phys. A, 49, 2016, 394003.
84. Bhat, U., Redner, S., Bénichou, O., Starvation dynamics of a greedy forager. J. Stat. Mech., 2017, 073213.
85. Grebenkov, D.S., Rupprecht, J.F., The escape problem for mortal walkers. J. Chem. Phys., 146, 2017, 084106.
86. T. Schilling, T. Voigtmann, Clearing out a maze: The hungry random walker and its anomalous diffusion, 2016, https://arxiv.org/abs/1607.01123.
87. Ghosh, R., Lerman, K., Rethinking centrality: The role of dynamical processes in social network analysis. Discrete Contin. Dyn. Syst. Ser. B 19 (2014), 1355–1372.
88. Yan, X., Teng, S.h., Lerman, K., Ghosh, R., Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators. PeerJ Comput. Sci., 2, 2016, e57.
89. Anderson, R.M., May, R.M., Infectious Diseases of Humans. 1991, Oxford University Press, Oxford, UK.
90. Pastor-Satorras, R., Castellano, C., Van Mieghem, P., Vespignani, A., Epidemic processes in complex networks. Rev. Modern Phys. 87 (2015), 925–979.
91. Y. Wang, D. Chakrabarti, C. Wang, C. Faloutsos, Epidemic spreading in real networks: an eigenvalue viewpoint, in: Proc. 22nd International Symposium on Reliable Distributed Systems, SRDS'03, 2003, pp. 25–34.
92. Klemm, K., Serrano, M.Á., Eguíluz, V.M., San Miguel, M., A measure of individual role in collective dynamics. Sci. Rep., 2, 2012, 292.
93. Godsil, C., Royle, G., Algebraic Graph Theory. 2001, Springer, New York, NY, USA.
94. Valente, T.W., Network Models of the Diffusion of Innovations. 1995, Hampton Press, Cresskill, NJ, USA.
95. Asllani, M., Challenger, J.D., Pavone, F.S., Sacconi, L., Fanelli, D., The theory of pattern formation on directed networks. Nat. Commun., 5, 2014, 4517, 10.1038/ncomms5517.
96. Montroll, E.W., Weiss, G.H., Random walks on lattices. II. J. Math. Phys. 6 (1965), 167–181.
97. Cox, D.R., Renewal Theory. 1962, Methuen & Co. Ltd., Frome, UK.
98. Grigolini, P., Palatella, L., Raffaelli, G., Asymmetric anomalous diffusion: An efficient way to detect memory in time series. Fractals 9 (2001), 439–449.
99. Hoory, S., Linial, N., Wigderson, A., Expander graphs and their applications. Bull. Amer. Math. Soc. 43 (2006), 439–561, 10.1090/S0273-0979-06-01126-8.
100. Clauset, A., Shalizi, C.R., Newman, M.E.J., Power-law distributions in empirical data. SIAM Rev. 51 (2009), 661–703.
101. Eisler, Z., Kertész, J., Random walks on complex networks with inhomogeneous impact. Phys. Rev. E, 71, 2005, 057104.
102. Wang, W.X., Wang, B.H., Yin, C.Y., Xie, Y.B., Zhou, T., Traffic dynamics based on local routing protocol on a scale-free network. Phys. Rev. E, 73, 2006, 026111.
103. Fronczak, A., Fronczak, P., Biased random walks in complex networks: The role of local navigation rules. Phys. Rev. E, 80, 2009, 016107.
104. Lee, S., Yook, S.H., Kim, Y., Centrality measure of complex networks using biased random walks. Eur. Phys. J. B 68 (2009), 277–281.
105. Baronchelli, A., Pastor-Satorras, R., Mean-field diffusive dynamics on weighted networks. Phys. Rev. E, 82, 2010, 011111.
106. Bonaventura, M., Nicosia, V., Latora, V., Characteristic times of biased random walks on complex networks. Phys. Rev. E, 89, 2014, 012803.
107. Demetrius, L., Manke, T., Robustness and network evolution—an entropic principle. Physica A 346 (2005), 682–696.
108. Gómez-Gardeñes, J., Latora, V., Entropy rate of diffusion processes on complex networks. Phys. Rev. E, 78, 2008, 065102(R), 10.1103/PhysRevE.78.065102.
109. Burda, Z., Duda, J., Luck, J.M., Waclaw, B., Localization of the maximal entropy random walk. Phys. Rev. Lett., 102, 2009, 160602.
110. Delvenne, J.C., Libert, A.S., Centrality measures and thermodynamic formalism for complex networks. Phys. Rev. E, 83, 2011, 046117.
111. Sinatra, R., Gómez-Gardeñes, J., Lambiotte, R., Nicosia, V., Latora, V., Maximal-entropy random walks in complex networks with limited information. Phys. Rev. E, 83, 2011, 030103(R), 10.1103/PhysRevE.83.030103.
112. Kemeny, J.G., Snell, J.L., Finite Markov Chains (Second Printing). 1976, Springer-Verlag, New York, NY, USA.
113. Papoulis, A., Pillai, S.U., Probability, Random Variables, and Stochastic Processes. fourth ed., 2002, McGraw-Hill, New York, NY, USA.
114. Iosifescu, M., Finite Markov Processes and Their Applications. 1980, Dover Publications, Mineola, NY, USA.
115. Stewart, W.J., Introduction to the Numerical Solution of Markov Chains. 1994, Princeton University Press, Princeton, NJ, USA.
116. Norris, J.R., Markov Chains. 1997, Cambridge University Press, Cambridge, UK.
117. Taylor, H.M., Karlin, S., An Introduction to Stochastic Modeling. third ed., 1998, Academic Press, San Diego, CA, USA.
118. Levin, D.A., Peres, Y., Wilmer, E.L., Markov Chains and Mixing Times. 2009, American Mathematical Society, Providence, RI, USA.
119. Blanchard, P., Volchenkov, D., Random Walks and Diffusions on Graphs and Databases: An Introduction. 2011, Springer, Heidelberg, Germany.
120. Privault, N., Understanding Markov Chains: Examples and Applications. 2013, Springer, Singapore.
121. Sethna, J.P., Statistical Mechanics: Entropy, Order Parameters and Complexity. 2006, Oxford University Press, Oxford, UK.
122. B.K. Fosdick, D.B. Larremore, J. Nishimura, J. Ugander, Configuring random graph models with fixed degree sequences, SIAM Rev. (2017), (in press) https://arxiv.org/abs/1608.00607.
123. Colizza, V., Vespignani, A., Epidemic modeling in metapopulation systems with heterogeneous coupling pattern: Theory and simulations. J. Theoret. Biol. 251 (2008), 450–467.
124. Lin, Y., Zhang, Z., Random walks in weighted networks with a perfect trap: An application of Laplacian spectra. Phys. Rev. E, 87, 2013, 062140.
125. Zhang, Z., Shan, T., Chen, G., Random walks on weighted networks. Phys. Rev. E, 87, 2013, 012112.
126. Donato, D., Laura, L., Leonardi, S., Millozzi, S., Large scale properties of the Webgraph. Eur. Phys. J. B 38 (2004), 239–243.
127. Fortunato, S., Flammini, A., Menczer, F., Vespignani, A., Topical interests and the mitigation of search engine bias. Proc. Natl. Acad. Sci. USA 103 (2006), 12684–12689.
128. Restrepo, J.G., Ott, E., Hunt, B.R., Characterizing the dynamical importance of network nodes and links. Phys. Rev. Lett., 97, 2006, 094102.
129. Davis, P.M., Eigenfactor: Does the principle of repeated improvement result in better estimates than raw citation counts?. J. Amer. Soc. Info. Sci. Technol. 59 (2008), 2186–2188.
130. Fortunato, S., Boguñá, M., Flammini, A., Menczer, F., Approximating pageRank from in-degree. Lecture Notes in Comput. Sci. 4936 (2008), 59–71.
131. Fersht, A., The most influential journals: Impact factor and Eigenfactor. Proc. Natl. Acad. Sci. USA 106 (2009), 6883–6884.
132. Masuda, N., Ohtsuki, H., Evolutionary dynamics and fixation probabilities in directed networks. New J. Phys., 11, 2009, 033012.
133. Ghoshal, G., Barabási, A.L., Ranking stability and super-stable nodes in complex networks. Nature Commun., 2, 2011, 394.
134. Sandryhaila, A., Moura, J.M.F., Discrete signal processing on graphs. IEEE Trans. Signal Process. 61 (2013), 1644–1656.
135. Tremblay, N., Borgnat, P., Graph wavelets for multiscale community mining. IEEE Trans. Signal Process. 62 (2014), 5227–5239.
136. Samukhin, A.N., Dorogovtsev, S.N., Mendes, J.F.F., Laplacian spectra of, and random walks on, complex networks: Are scale-free architectures really important?. Phys. Rev. E, 77, 2008, 036115.
137. Chung, F.R.K., Spectral Graph Theory. 1997, American Mathematical Society, Providence, RI, USA.
138. Donetti, L., Neri, F., Muñoz, M.A., Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that. J. Stat. Mech., 2006, 2006, P08007.
139. Cvetković, D., Rowlinson, P., Simić, S., An Introduction to the Theory of Graph Spectra. 2010, Cambridge University Press, Cambridge, UK.
140. Van Mieghem, P., Graph Spectra for Complex Networks. 2011, Cambridge University Press.
141. Golub, G.H., Van Loan, C.F., Matrix Computations, third ed., 1996, The Johns Hopkins University Press, Baltimore, MD, USA.
142. Estrada, E., Hatano, N., Benzi, M., The physics of communicability in complex networks. Phys. Rep. 514 (2012), 89–119.
143. Miekkala, U., Graph properties for splitting with grounded Laplacian matrices. BIT 33 (1993), 485–495.
144. Noh, J.D., Rieger, H., Random walks on complex networks. Phys. Rev. Lett., 92, 2004, 118701.
145. Wilf, H.S., generatingfunctionology. third ed., 2005, A K Peters, Ltd., Wellesley, MA, USA.
146. Kittas, A., Carmi, S., Havlin, S., Argyrakis, P., Trapping in complex networks. Europhys. Lett., 84, 2008, 40008.
147. Perra, N., Baronchelli, A., Mocanu, D., Gonçalves, B., Pastor-Satorras, R., Vespignani, A., Random walks and search in time-varying networks. Phys. Rev. Lett., 109, 2012, 238701.
148. Starnini, M., Baronchelli, A., Barrat, A., Pastor-Satorras, R., Random walks on temporal networks. Phys. Rev. E, 85, 2012, 056115.
149. Almaas, E., Kulkarni, R.V., Stroud, D., Scaling properties of random walks on small-world networks. Phys. Rev. E, 68, 2003, 056105.
150. Masuda, N., Konno, N., Return times of random walk on generalized random graphs. Phys. Rev. E, 69, 2004, 066113.
151. Hwang, S., Lee, D.S., Kahng, B., Effective trapping of random walkers in complex networks. Phys. Rev. E, 85, 2012, 046110.
152. Hwang, S., Lee, D.S., Kahng, B., Origin of the hub spectral dimension in scale-free networks. Phys. Rev. E, 87, 2013, 022816.
153. Peng, J., Agliari, E., Zhang, Z., Exact calculations of first-passage properties on the pseudofractal scale-free web. Chaos, 25, 2015, 073118.
154. Montroll, E.W., Random walks on lattices. III. Calculation of first-passage times with application to exciton trapping on photosynthetic units. J. Math. Phys. 10 (1969), 753–765.
155. Bollt, E.M., ben-Avraham, D., What is special about diffusion on scale-free nets?. New J. Phys., 7, 2005, 26.
156. Sood, V., Redner, S., ben-Avraham, D., First-passage properties of the Erdős-Renyi random graph. J. Phys. A 38 (2005), 109–123.
157. Löwe, M., Torres, F., On hitting times for a simple random walk on dense Erdös–Rényi random graphs. Statist. Probab. Lett. 89 (2014), 81–88.
158. Tishby, I., Biham, O., Katzav, E., The distribution of first hitting times of random walks on directed Erdős-Rényi networks. J. Stat. Mech., 2017, 043402.
159. Jespersen, S., Sokolov, I.M., Blumen, A., Relaxation properties of small-world networks. Phys. Rev. E 62 (2000), 4405–4408.
160. Pandit, S.A., Amritkar, R.E., Random spread on the family of small-world networks. Phys. Rev. E, 63, 2001, 041104.
161. Lahtinen, J., Kertész, J., Kaski, K., Scaling of random spreading in small world networks. Phys. Rev. E, 64, 2001, 057105.
162. Jasch, F., Blumen, A., Trapping of random walks on small-world networks. Phys. Rev. E, 64, 2001, 066104.
163. Parris, P.E., Kenkre, V.M., Traversal times for random walks on small-world networks. Phys. Rev. E, 72, 2005, 056119.
164. Yang, S.J., Exploring complex networks by walking on them. Phys. Rev. E, 71, 2005, 016107.
165. Porter, M.A., Small-world network. Scholarpedia, 7(2), 2012, 1739.
166. Hwang, S., Lee, D.S., Kahng, B., First passage time for random walks in heterogeneous networks. Phys. Rev. Lett., 109, 2012, 088701.
167. Condamin, S., Bénichou, O., Tejedor, V., Voituriez, R., Klafter, J., First-passage times in complex scale-invariant media. Nature 450 (2007), 77–80.
168. Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F., Pseudofractal scale-free web. Phys. Rev. E, 65, 2002, 066122.
169. Ravasz, E., Somera, A.L., Mongru, D.A., Oltvai, Z.N., Barabási, A.L., Hierarchical organization of modularity in metabolic networks. Science 297 (2002), 1551–1555.
170. Ravasz, E., Barabási, A.L., Hierarchical organization in complex networks. Phys. Rev. E, 67, 2003, 026112.
171. Rozenfeld, H.D., Havlin, S., ben Avraham, D., Fractal and transfractal recursive scale-free nets. New J. Phys., 9, 2007, 175.
172. Song, C., Havlin, S., Makse, H.A., Self-similarity of complex networks. Nature 433 (2005), 392–395.
173. Song, C.M., Havlin, S., Makse, H.A., Origins of fractality in the growth of complex networks. Nat. Phys. 2 (2006), 275–281.
174. Simon, H.A., The architecture of complexity. Proc. Am. Phil. Soc. 106 (1962), 467–482 http://www.jstor.org/stable/985254.
175. J. Leskovec, D. Huttenlocher, J. Kleinberg, Signed networks in social media, in: Proc. 28th International Conference on Human Factors in Computing Systems - CHI ’10, 2010, pp. 1361–1370.
176. Karrer, B., Newman, M.E.J., Random graph models for directed acyclic networks. Phys. Rev. E, 80, 2009, 046110.
177. Falconer, K., Fractals: A Very Short Introduction. 2013, Oxford University Press, Oxford, UK.
178. Kozak, J.J., Balakrishnan, V., Analytic expression for the mean time to absorption for a random walker on the Sierpinski gasket. Phys. Rev. E, 65, 2002, 021105.
179. Havlin, S., Weissman, H., Mapping between hopping on hierarchical structures and diffusion on a family of fractals. J. Phys. A 19 (1986), L1021–L1026.
180. Kahng, B., Redner, S., Scaling of the first-passage time and the survival probability on exact and quasi-exact self-similar structures. J. Phys. A 22 (1989), 887–902.
181. Agliari, E., Exact mean first-passage time on the T-graph. Phys. Rev. E, 77, 2008, 011128.
182. Vicsek, T., Fractal models for diffusion controlled aggregation. J. Phys. A 16 (1983), L647–L652.
183. Blumen, A., Jurjiu, A., Koslowski, T., von Ferber, C., Dynamics of Vicsek fractals, models for hyperbranched polymers. Phys. Rev. E, 67, 2003, 061103.
184. Zhang, Z., Wu, B., Zhang, H., Zhou, S., Guan, J., Wang, Z., Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices. Phys. Rev. E, 81, 2010, 031118.
185. Matan, O., Havlin, S., Mean first-passage time on loopless aggregates. Phys. Rev. A 40 (1989), 6573–6579.
186. Berker, A.N., Ostlund, S., Renormalization-group calculations of finite systems: Order parameter and specific heat for epitaxial ordering. J. Phys. C 12 (1979), 4961–4975.
187. Tejedor, V., Bénichou, O., Voituriez, R., Global mean first-passage times of random walks on complex networks. Phys. Rev. E, 80, 2009, 065104(R), 10.1103/PhysRevE.80.065104.
188. Zhang, Z., Lin, Y., Ma, Y., Effect of trap position on the efficiency of trapping in treelike scale-free networks. J. Phys. A, 44, 2011, 075102.
189. Yun, C.K., Kahng, B., Kim, D., Annihilation of two-species reaction–diffusion processes on fractal scale-free networks. New J. Phys., 11, 2009, 063025.
190. Barabási, A.L., Ravasz, E., Vicsek, T., Deterministic scale-free networks. Physica A 299 (2001), 559–564.
191. Jung, S., Kim, S., Kahng, B., Geometric fractal growth model for scale-free networks. Phys. Rev. E, 65, 2002, 056101.
192. Andrade, J.S. Jr., Herrmann, H.J., Andrade, R.F.S., da Silva, L.R., Apollonian networks: Simultaneously scale-free, small world, Euclidean, space filling, and with matching graphs. Phys. Rev. Lett., 94, 2005, 018702.
193. Doye, J.P.K., Massen, C.P., Self-similar disk packings as model spatial scale-free networks. Phys. Rev. E, 71, 2005, 016128.
194. Zhang, Z., Qi, Y., Zhou, S., Xie, W., Guan, J., Exact solution for mean first-passage time on a pseudofractal scale-free web. Phys. Rev. E, 79, 2009, 021127.
195. Zhang, Z., Qi, Y., Zhou, S., Gao, S., Guan, J., Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees. Phys. Rev. E, 81, 2010, 016114.
196. Zhang, Z., Guo, X., Lin, Y., Full eigenvalues of the Markov matrix for scale-free polymer networks. Phys. Rev. E, 90, 2014, 022816.
197. Agliari, E., Burioni, R., Random walks on deterministic scale-free networks: Exact results. Phys. Rev. E, 80, 2009, 031125.
198. Zhang, Z., Lin, Y., Gao, S., Zhou, S., Guan, J., Li, M., Trapping in scale-free networks with hierarchical organization of modularity. Phys. Rev. E, 80, 2009, 051120.
199. Zhang, Z., Guan, J., Xie, W., Qi, Y., Zhou, S., Random walks on the Apollonian network with a single trap. Europhys. Lett., 86, 2009, 10006.
200. Reuveni, S., Granek, R., Klafter, J., Vibrational shortcut to the mean-first-passage-time problem. Phys. Rev. E, 81, 2010, 040103(R), 10.1103/PhysRevE.81.040103.
201. Gallos, L.K., Song, C., Havlin, S., Makse, H.A., Scaling theory of transport in complex biological networks. Proc. Natl. Acad. Sci. USA 104 (2007), 7746–7751.
202. Baronchelli, A., Loreto, V., Ring structures and mean first passage time in networks. Phys. Rev. E, 73, 2006, 026103.
203. Lau, H.W., Szeto, K.Y., Asymptotic analysis of first passage time in complex networks. Europhys. Lett., 90, 2010, 40005.
204. Cooper, C., Frieze, A., The cover time of sparse random graphs. Random Struct. Algorithms 30 (2007), 1–16.
205. Cooper, C., Frieze, A., The cover time of the preferential attachment graph. J. Combin. Theory Ser. B 97 (2007), 269–290.
206. Chupeau, M., Bénichou, O., Voituriez, R., Cover times of random searches. Nat. Phys. 11 (2015), 844–847.
207. B.F. Maier, D. Brockmann, Cover time for random walks on arbitrary complex networks, 2017, https://arxiv.org/abs/1706.02356.
208. G. Barnes, U. Feige, Short random walks on graphs, in: Proc. Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC ’93, 1993, pp. 728–737.
209. Gallos, L.K., Random walk and trapping processes on scale-free networks. Phys. Rev. E, 70, 2004, 046116.
210. Stauffer, D., Sahimi, M., Diffusion in scale-free networks with annealed disorder. Phys. Rev. E, 72, 2005, 046128.
211. da Fontoura Costa, L., Travieso, G., Exploring complex networks through random walks. Phys. Rev. E, 75, 2007, 016102, 10.1103/PhysRevE.75.016102.
212. Baronchelli, A., Catanzaro, M., Pastor-Satorras, R., Random walks on complex trees. Phys. Rev. E, 78, 2008, 011114.
213. Asztalos, A., Toroczkai, Z., Network discovery by generalized random walks. Europhys. Lett., 92, 2010, 50008.
214. Hoffmann, T., Porter, M.A., Lambiotte, R., Generalized master equations for non-Poisson dynamics on networks. Phys. Rev. E, 86, 2012, 046102.
215. Speidel, L., Lambiotte, R., Aihara, K., Masuda, N., Steady state and mean recurrence time for random walks on stochastic temporal networks. Phys. Rev. E, 91, 2015, 012806.
216. Colizza, V., Pastor-Satorras, R., Vespignani, A., Reaction-diffusion processes and metapopulation models in heterogeneous networks. Nat. Phys. 3 (2007), 276–282.
217. Vespignani, A., Modelling dynamical processes in complex socio-technical systems. Nat. Phys. 8 (2011), 32–39.
218. Scardal, P.S., Taylor, D., Sun, J., Arenas, A., Collective frequency variation in network synchronization and reverse PageRank. Phys. Rev. E, 93, 2016, 042314, 10.1103/PhysRevE.93.042314.
219. Biggs, N., Algebraic potential theory on graphs. Bull. Lond. Math. Soc. 29 (1997), 641–682.
220. R.P. Agaev, P.Y. Chebotarev, The matrix of maximum out forests of a digraph and its applications, Autom. Rem. Cont. 61 (2000) 1424–1450.
221. Masuda, N., Kawamura, Y., Kori, H., Analysis of relative influence of nodes in directed networks. Phys. Rev. E, 80, 2009, 046114.
222. Masuda, N., Kawamura, Y., Kori, H., Impact of hierarchical modular structure on ranking of individual nodes in directed networks. New J. Phys., 11, 2009, 113002.
223. Ermentrout, G.B., Stable periodic solutions to discrete and continuum arrays of weakly coupled nonlinear oscillators. SIAM J. Appl. Math. 52 (1992), 1665–1687.
224. Merris, R., Laplacian matrices of graphs: A survey. Linear Algebra Appl. 197–198 (1994), 143–176.
225. Mohar, B., Some applications of Laplace eigenvalues of graphs. Hahn, G., Sabidussi, G., (eds.) Graph Symmetry: Algebraic Methods and Applications, 1997, Kluwer, Dordrecht, The Netherlands, 225–275.
226. Pecora, L.M., Carroll, T.L., Synchronization of chaotic systems. Chaos, 25, 2015, 097611.
227. Motter, A.E., Bounding network spectra for network design. New J. Phys., 9, 2007, 182.
228. Vázquez, A., Oliveira, J.G., Dezsö, Z., Goh, K.I., Kondor, I., Barabási, A.L., Modeling bursts and heavy tails in human dynamics. Phys. Rev. E, 73, 2006, 036127.
229. Kivelä, M., Porter, M.A., Estimating interevent time distributions from finite observation periods in communication networks. Phys. Rev. E, 92, 2015, 052813.
230. Delvenne, J.C., Lambiotte, R., Rocha, L.E.C., Diffusion on networked systems is a question of time or structure. Nat. Commun., 6, 2015, 7366.
231. De Nigris, S., Hastir, A., Lambiotte, R., Burstiness and fractional diffusion on complex networks. Eur. Phys. J. B, 89, 2016, 114.
232. Allen, A.O., Probability, Statistics, and Queueing Theory: With Computer Science Applications. second ed., 1990, Academic Press, Boston, MA, USA.
233. DeFord, D.R., Pauls, S.D., A new framework for dynamical models on multiplex networks. J. Compl. Netw., 2017, 10.1093/comnet/cnx041.
234. Mucha, P.J., Richardson, T., Macon, K., Porter, M.A., Onnela, J.P., Community structure in time-dependent, multiscale, and multiplex networks. Science 328 (2010), 876–878.
235. De Domenico, M., Lancichinetti, A., Arenas, A., Rosvall, M., Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Phys. Rev. X, 5, 2015, 011027.
236. Jeub, L.G.S., Mahoney, M.W., Mucha, P.J., Porter, M.A., A local perspective on community structure in multilayer networks. Netw. Sci. 5 (2017), 144–163.
237. Gómez, S., Díaz-Guilera, A., Gómez-Gardeñes, J., Pérez-Vicente, C.J., Moreno, Y., Arenas, A., Diffusion dynamics on multiplex networks. Phys. Rev. Lett., 110, 2013, 028701.
238. Solé-Ribalta, A., De Domenico, M., Kouvaris, N.E., Díaz-Guilera, A., Gómez, S., Arenas, A., Spectral properties of the Laplacian of multiplex networks. Phys. Rev. E, 88, 2013, 032807.
239. Radicchi, F., Arenas, A., Abrupt transition in the structural formation of interconnected networks. Nat. Phys. 9 (2013), 717–720.
240. De Domenico, M., Solé-Ribalta, A., Gómez, S., Arenas, A., Navigability of interconnected networks under random failures. Proc. Natl. Acad. Sci. USA 111 (2014), 8351–8356.
241. L. Lacasa, I.P. Mariño, J. Miguez, V. Nicosia, J. Gómez-Gardeñes, Identifying the hidden multiplex architecture of complex systems, 2017, https://arxiv.org/abs/1705.04661.
242. Perra, N., Gonçalves, B., Pastor-Satorras, R., Vespignani, A., Activity driven modeling of time varying networks. Sci. Rep., 2, 2012, 469.
243. Bollobás, B., Random Graphs. second ed., 2001, Cambridge University Press, Cambridge, UK.
244. Ribeiro, B., Perra, N., Baronchelli, A., Quantifying the effect of temporal resolution on time-varying networks. Sci. Rep., 3, 2013, 3006.
245. Alessandretti, L., Sun, K., Baronchelli, A., Perra, N., Random walks on activity-driven networks with attractiveness. Phys. Rev. E, 95, 2017, 052318.
246. Masuda, N., Klemm, K., Eguíluz, V.M., Temporal networks: Slowing down diffusion by long lasting interactions. Phys. Rev. Lett., 111, 2013, 188701.
247. Lambiotte, R., Salnikov, V., Rosvall, M., Effect of memory on the dynamics of random walks on networks. J. Comput. Netw. 3 (2015), 177–188.
248. Scholtes, I., Wider, N., Pfitzner, R., Garas, A., Tessone, C.J., Schweitzer, F., Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks. Nat. Comm., 5, 2014, 5024.
249. Sousa da Mata, A., Pastor-Satorras, R., Slow relaxation dynamics and aging in random walks on activity driven temporal networks. Eur. Phys. J. B, 88, 2015, 38, 10.1140/epjb/e2014-50801-1.
250. Rosvall, M., Esquivel, A.V., Lancichinetti, A., West, J.D., Lambiotte, R., Memory in network flows and its effects on spreading dynamics and community detection. Nat. Comm., 5, 2014, 4630, 10.1038/ncomms5630.
251. Rocha, L.E.C., Masuda, N., Random walk centrality for temporal networks. New J. Phys., 16, 2014, 063023.
252. Saramäki, J., Holme, P., Exploring temporal networks with greedy walks. Eur. Phys. J. B, 88, 2015, 334.
253. Harary, F., Norman, R.Z., Some properties of line digraphs. Rend. Circ. Mat. Palermo 9 (1960), 161–168.
254. Evans, T.S., Lambiotte, R., Line graphs, link partitions, and overlapping communities. Phys. Rev. E, 80, 2009, 016105.
255. Salnikov, V., Schaub, M.T., Lambiotte, R., Using higher-order Markov models to reveal flow-based communities in networks. Sci. Rep., 6, 2016, 23194.
256. Xu, J., Wickramarathne, T.L., Chawla, N.V., Representing higher-order dependencies in networks. Sci. Adv., 2, 2016, e1600028, 10.1126/sciadv.1600028.
257. Alon, N., Benjamini, I., Lubetzky, E., Sodin, S., Non-backtracking random walks mix faster. Commun. Contemp. Math. 9 (2007), 585–603.
258. Fitzner, R., van der Hofstad, R., Non-backtracking random walk. J. Stat. Phys. 150 (2013), 264–284.
259. Karrer, B., Newman, M.E.J., Zdeborová, L., Percolation on sparse networks. Phys. Rev. Lett., 113, 2014, 208702.
260. Hamilton, K.E., Pryadko, L.P., Tight lower bound for percolation threshold on an infinite graph. Phys. Rev. Lett., 113, 2014, 208701.
261. Martin, T., Zhang, X., Newman, M.E.J., Localization and centrality in networks. Phys. Rev. E, 90, 2014, 052808.
262. Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., Zhang, P., Spectral redemption in clustering sparse networks. Proc. Natl. Acad. Sci. USA 110 (2013), 20935–20940.
263. M.E.J. Newman, Spectral community detection in sparse networks, 2013, https://arxiv.org/abs/1308.6494.
264. C. Bordenave, M. Lelarge, L. Massoulié, Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs, in: Proc. IEEE 56th Annual Symp. Found. Comput. Sci., FOCS ’15, 2015, pp. 1347–1357.
265. Morone, F., Makse, H.A., Influence maximization in complex networks through optimal percolation. Nature 524 (2015), 65–68.
266. Takaguchi, T., Nakamura, M., Sato, N., Yano, K., Masuda, N., Predictability of conversation partners. Phys. Rev. X, 1, 2011, 011008.
267. Pfitzner, R., Scholtes, I., Garas, A., Tessone, C.J., Schweitzer, F., Betweenness preference: Quantifying correlations in the topological dynamics of temporal networks. Phys. Rev. Lett., 110, 2013, 198701.
268. Li, W., Ng, M.K., On the limiting probability distribution of a transition probability tensor. Linear Multilinear Algebra 62 (2014), 362–385.
269. Benson, A.R., Gleich, D.F., Lim, L.H., The spacey random walk: A stochastic process for higher-order data. SIAM Rev. 59 (2017), 321–345.
270. Kareiva, P., Shigesada, N., Analyzing insect movement as a correlated random walk. Oecologia 56 (1983), 234–238.
271. F. Chierichetti, R. Kumar, P. Raghavan, T. Sarlós, Are web users really Markovian?, in: Proc. 21st Intl. Conf. World Wide Web, WWW ’12, 2012, pp. 609–618.
272. J. Kleinberg, Complex networks and decentralized search algorithms, in: Proc. Internat. Congress Math., 2006, pp. 1019–1044.
273. Q. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and replication in unstructured peer-to-peer networks, in: Proc. 16th Internat. Conf. Supercomputing, ICS ’02, 2002, pp. 84–95.
274. N. Bisnik, A. Abouzeid, Modeling and analysis of random walk search algorithms in P2P networks, in: Proc. Second International Workshop on Hot Topics in Peer-To-Peer Systems, 2005, pp. 95–103.
275. Tanenbaum, A.S., Wetherall, D.J., Computer Networks. fifth ed., 2011, Prentice Hall, Boston, MA, USA.
276. Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A., Search in power-law networks. Phys. Rev. E, 64, 2001, 046135.
277. Lü, L., Chen, D., Ren, X.L., Zhang, Q.M., Zhang, Y.C., Zhou, T., Vital nodes identification in complex networks. Phys. Rep. 650 (2016), 1–63.
278. Katz, L., A new status index derived from sociometric analysis. Psychometrika 18 (1953), 39–43.
279. Kleinberg, J.M., Authoritative sources in a hyperlinked environment. J. ACM 46 (1999), 604–632.
280. Grindrod, P., Parsons, M.C., Higham, D.J., Estrada, E., Communicability across evolving networks. Phys. Rev. E, 83, 2011, 046120.
281. Halu, A., Mondragón, R.J., Panzarasa, P., Bianconi, G., Multiplex PageRank. PLoS One, 8, 2013, e78293.
282. De Domenico, M., Solé-Ribalta, A., Omodei, E., Gómez, S., Arenas, A., Ranking in interconnected multilayer networks reveals versatile nodes. Nat. Comm., 6, 2015, 6868.
283. Solé-Ribalta, A., De Domenico, M., Gómez, S., Arenas, A., Random walk centrality in interconnected multilayer networks. Physica D 323–324 (2016), 73–79.
284. Taylor, D., Myers, S.A., Clauset, A., Porter, M.A., Mucha, P.J., Eigenvector-based centrality measures for temporal networks. Multiscale Model. Simul. 15 (2017), 537–574.
285. Liao, H., Mariani, M.S., Medo, M., Zhang, Y.C., Zhou, M.Y., Ranking in evolving complex networks. Phys. Rep. 689 (2017), 1–54.
286. Page, L., Brin, S., Motwani, R., Winograd, T., The PageRank citation ranking: Bringing order to the web, Technical Report 1999-66, 1999, Stanford InfoLab http://ilpubs.stanford.edu:8090/422/.
287. Pinski, G., Narin, F., Citation influence for journal aggregates of scientific publications: Theory, with application to literature of physics. Info. Proc. Manag. 12 (1976), 297–312.
288. Langville, A.N., Meyer, C.D., Deeper inside PageRank. Internet Math. 1 (2004), 335–380.
289. Berkhin, P., A survey on PageRank computing. Internet Math. 2 (2005), 73–120.
290. Langville, A.N., Meyer, C.D., Google's PageRank and Beyond: The Science of Search Engine Rankings, 2006, Princeton University Press, Princeton, NJ, USA.
291. Kamvar, S., Numerical Algorithms for Personalized Search in Self-organizing Information Networks. 2010, Princeton University Press, Princeton, NJ, USA.
292. Ermann, L., Frahm, K.M., Shepelyansky, D.L., Google matrix analysis of directed networks. Rev. Modern Phys., 88, 2016, 039905.
293. Winter, C., et al. Google goes cancer: Improving outcome prediction for cancer patients by network-based ranking of marker genes. PLOS Comput. Biol., 8, 2012, e1002511.
294. Radicchi, F., Who is the best player ever? A complex network analysis of the history of professional tennis. PLoS One, 6, 2011, e17249.
295. Callaghan, T., Mucha, P.J., Porter, M.A., Random walker ranking for NCAA division I-A football. Amer. Math. Monthly 114 (2007), 761–777.
296. Park, J., Newman, M.E.J., A network-based ranking system for US college football. J. Stat. Mech., 2005, P10014.
297. Saavedra, S., Powers, S., McCotter, T., Porter, M.A., Mucha, P.J., Mutually-antagonistic interactions in baseball networks. Physica A 389 (2010), 1131–1141.
298. Lages, J., Patt, A., Shepelyansky, D.L., Wikipedia ranking of world universities. Eur. Phys. J. B, 89, 2016, 69.
299. Myers, S.A., Mucha, P.J., Porter, M.A., Mathematical genealogy and department prestige. Chaos, 21, 2011, 041104.
300. Folke Mitzlaff, Gerd Stumme, Recommending given names, 2013, https://arxiv.org/abs/1302.4412.
301. Brin, S., Motwani, R., Page, L., Winograd, T., What can you do with a Web in your Pocket?. Bull. IEEE Comput. Soc. Tech. Comm. Data Eng. 21 (1998), 37–47 http://sites.computer.org/debull/98june/webbase.ps.
302. T.H. Haveliwala, Topic-sensitive PageRank, in: Proc. Eleventh Intl. Conf. World Wide Web, WWW ’02, 2002, pp. 517–526.
303. G. Jeh, J. Widom, Scaling personalized web search, in: Proc. Twelfth Intl. Conf. World Wide Web, WWW ’03, 2003, pp. 271–279.
304. W. Xie, D. Bindel, A. Demers, J. Gehrke, Edge-weighted personalized PageRank: Breaking a decade-old performance barrier, in: Proc. 21st ACM SIGKDD Intl. Conf. Knowledge Disc. Data Mining, KDD ’15, 2015, pp. 1325–1334.
305. Lambiotte, R., Rosvall, M., Ranking and clustering of nodes in networks with smart teleportation. Phys. Rev. E, 85, 2012, 056107.
306. P. Boldi, M. Santini, S. Vigna, PageRank as a function of the damping factor, in: Proc. 14th Internat. Conf. on World Wide Web, 2005, pp. 557–566.
307. Brinkmeier, M., PageRank revisited. ACM Trans. Internet Tech. 6 (2006), 282–301.
308. Chung, F., The heat kernel as the pagerank of a graph. Proc. Natl. Acad. Sci. USA 104 (2007), 19735–19740.
309. Chung, F., A local graph partitioning algorithm using heat kernel pagerank. Internet Math. 6 (2009), 315–330.
310. D. Zhou, S.A. Orshanskiy, H. Zha, C.L. Giles, Co-ranking authors and documents in a heterogeneous network, in: Seventh IEEE Int. Conf. Data Mining (ICDM 2007), 2007, pp. 739–744.
311. M.K. Ng, X. Li, Y. Ye, MultiRank: Co-ranking for objects and relations in multi-relational data, in: Proc. 17th ACM SIGKDD Int. Conf. Knowledge Disc. Data Mining, KDD ’11, 2011, pp. 1217–1225.
312. Pedroche, F., Romance, M., Criado, R., A biplex approach to PageRank centrality: From classic to multiplex networks. Chaos, 26, 2016, 065301.
313. Daniels, H.E., Round-robin tournament scores. Biometrika 56 (1969), 295–299.
314. Moon, J.W., Pullman, N.J., On generalized tournament matrices. SIAM Rev. 12 (1970), 384–399.
315. Berman, K.A., A graph theoretical approach to handicap ranking of tournaments and paired comparisons. SIAM Alg. Discrete Methods 1 (1980), 359–361.
316. Borm, N.E., Brink, R. Van Den, Slikker, M., An iterative procedure for evaluating digraph competitions. Ann. Oper. Res. 109 (2002), 61–75, 10.1023/A:1016339832755.
317. Taylor, P.D., Allele-frequency change in a class-structured population. Am. Nat. 135 (1990), 95–106.
318. Taylor, P.D., Inclusive fitness arguments in genetic models of behaviour. J. Math. Biol. 34 (1996), 654–674.
319. Grindrod, P., Higham, D.J., A matrix iteration for dynamic network summaries. SIAM Rev. 55 (2013), 118–128.
320. Freeman, L.C., A set of measures of centrality based on betweenness. Sociometry 40 (1977), 35–41.
321. Newman, M.E.J., A measure of betweenness centrality based on random walks. Soc. Netw. 27 (2005), 39–54.
322. Ben-Akiva, M., Lerman, S.R., Discrete Choice Analysis: Theory and Application to Travel Demand. 1985, MIT Press, Cambridge, MA.
323. Train, K.E., Discrete Choice Methods with Simulation, second ed., 2009, Cambridge University Press, Cambridge, UK.
324. C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation methods for the Web, in: Proc. Tenth Intl. Conf. World Wide Web, WWW ’01, 2001, pp. 613–622.
325. Bradley, R.A., Terry, M.E., Rank analysis of incomplete block designs: I. The method of paired comparisons. Biometrika 39 (1952), 324–345.
326. Luce, R.D., Individual Choice Behavior: A Theoretical Analysis. 1959, Wiley, New York, NY.
327. Ragain, S., Ugander, J., Pairwise choice Markov chains. Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R., (eds.) Advances in Neural Information Processing Systems, vol. 29, 2016, Curran Associates, Inc., 3198–3206 https://papers.nips.cc/paper/6287-pairwise-choice-markov-chains.pdf.
328. Block, H.D., Marschak, J., Random orderings and stochastic theories of responses. Olkin, I., Ghuyre, S.G., Hoeffding, W., Madow, W.G., Mann, H.B., (eds.) Contributions To Probability and Statistics: Essays in Honor of Harold Hotelling, 1960, Stanford University Press, Redwood City, CA, 97–132 https://econpapers.repec.org/paper/cwlcwldpp/66.htm.
329. Plackett, R.L., The Analysis of permutations. J. R. Stat. Soc. Ser. C. Appl. Stat. 24 (1975), 193–202.
330. Maystre, L., Grossglauser, M., Fast and accurate inference of Plackett–Luce models. Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R., (eds.) Advances in Neural Information Processing Systems 28, 2015, Curran Associates, Inc., 172–180 https://papers.nips.cc/paper/5681-fast-and-accurate-inference-of-plackettluce-models.
331. Negahban, S., Oh, S., Shah, D., Iterative ranking from pair-wise comparisons. Pereira, F., Burges, C.J.C., Bottou, L., Weinberger, K.Q., (eds.) Advances in Neural Information Processing Systems, vol. 25, 2012, Curran Associates, Inc., 2474–2482 https://papers.nips.cc/paper/4701-iterative-ranking-from-pair-wise-comparisons.
332. Negahban, S., Oh, S., Shah, D., Rank centrality: Ranking from pairwise comparisons. Oper. Res. 65 (2017), 266–287.
333. Shi, J., Malik, J., Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22 (2000), 888–905, 10.1109/34.868688.
334. van Dongen, S.M., (Ph.D. thesis) Graph Clustering by Flow Simulation, 2001, University of Utrecht https://dspace.library.uu.nl/handle/1874/848.
335. Eriksen, K.A., Simonsen, I., Maslov, S., Sneppen, K., Modularity and extreme edges of the Internet. Phys. Rev. Lett., 90, 2003, 148701.
336. Zhou, H., Network landscape from a Brownian particle's perspective. Phys. Rev. E, 67, 2003, 041908.
337. Arenas, A., Díaz-Guilera, A., Pérez-Vicente, C.J., Synchronization reveals topological scales in complex networks. Phys. Rev. Lett., 96, 2006, 114102.
338. Newman, M.E.J., Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74, 2006, 036104.
339. Danon, L., Arenas, A., Díaz-Guilera, A., Impact of community structure on information transfer. Phys. Rev. E, 77, 2008, 036103.
340. Cheng, X.Q., Shen, H.W., Uncovering the community structure associated with the diffusion dynamics on networks. J. Stat. Mech., 2010, 2010, P04024.
341. Lambiotte, R., Sinatra, R., Delvenne, J.C., Evans, T.S., Barahona, M., Latora, V., Flow graphs: Interweaving dynamics and structure. Phys. Rev. E, 84, 2011, 017102.
342. Piccardi, C., Finding and testing network communities by lumped Markov chains. PLoS One, 6, 2011, e27028.
343. Sarzynska, M., Leicht, E.A., Chowell, G., Porter, M.A., Null models for community detection in spatially embedded, temporal networks. J. Comput. Netw. 4 (2016), 363–406.
344. Bazzi, M., Porter, M.A., Williams, S., McDonald, M., Fenn, D.J., Howison, S.D., Community detection in temporal multilayer networks, with an application to correlation networks. Multiscale Model. Simul. 14 (2016), 1–41.
345. Fortunato, S., Barthélemy, M., Resolution limit in community detection. Proc. Natl. Acad. Sci. USA 104 (2007), 36–41.
346. Good, B.H., de Montjoye, Y.A., Clauset, A., Performance of modularity maximization in practical contexts. Phys. Rev. E, 81, 2010, 046106.
347. M. Lambiotte, J.C. Delvenne, M. Barahona, Laplacian dynamics and multiscale modular structure in networks, 2008, arXiv:0812.1770v2.
348. Schaub, M.T., Delvenne, J.C., Yaliraki, S.N., Barahona, M., Markov dynamics as a zooming lens for multiscale community detection: Non clique-like communities and the field-of-view limit. PLoS One, 7, 2012, e32210.
349. Beguerisse-Díaz, M., Garduño-Hernández, G., Vangelov, B., Yaliraki, S.N., Barahona, M., Interest communities and flow roles in directed networks: The Twitter network of the UK riots. J. R. Soc. Interface, 11, 2014, 20140940.
350. Lambiotte, R., Delvenne, J.C., Barahona, M., Random walks, Markov processes and the multiscale modular organization of complex networks. IEEE Trans. Netw. Sci. Eng. 1 (2014), 76–90.
351. Delvenne, J.C., Yaliraki, S.N., Barahona, M., Stability of graph communities across time scales. Proc. Natl. Acad. Sci. USA 107 (2010), 12755–12760.
352. Delvenne, J.C., Schaub, M.T., Yaliraki, S.N., Barahona, M., The stability of a graph partition: A dynamics-based framework for community detection. Mukherjee, A., Choudhury, M., Peruani, F., Ganguly, N., Mitra, B., (eds.) Dynamics on and of Complex Networks, Volume 2: Applications To Time-Varying Dynamical Systems, 2013, Springer, New York, NY, USA, 221–242.
353. Reichardt, J., Bornholdt, S., Statistical mechanics of community detection. Phys. Rev. E, 74, 2006, 016110.
354. Newman, M.E.J., Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys. Rev. E, 94, 2016, 052315.
355. Bassett, D.S., Porter, M.A., Wymbs, N.F., Grafton, S.T., Carlson, J.M., Mucha, P.J., Robust detection of dynamic community structure in networks. Chaos, 23, 2013, 013142.
356. Pons, P., Latapy, M., Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10 (2006), 191–218.
357. Zhou, H., Lipowsky, R., Network Brownian motion: A new method to measure vertex-vertex proximity and to identify communities and subcommunities. Lecture Notes in Comput. Sci. 3038 (2004), 1062–1069.
358. Newman, M.E.J., Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69, 2004, 066133.
359. Fouss, F., Pirotte, A., Renders, J.M., Saerens, M., Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19 (2007), 355–369.
360. Barnett, S., Matrices: Methods and Applications. 1990, Oxford University Press, Oxford, UK.
361. Rosvall, M., Bergstrom, C.T., Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. USA 105 (2008), 1118–1123.
362. Rosvall, M., Bergstrom, C.T., Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLoS One, 6, 2011, e18209.
363. Huffman, D.A., A method for the construction of minimum-redundancy codes. Proc. IRE 40 (1952), 1098–1101.
364. M. Rosvall, MapDemo (demonstration of map equation), 2016, http://www.mapequation.org/apps/MapDemo.html (3 September 2016).
365. D.A. Spielman, S.H. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, in: Proc. Thirty-Sixth Annual ACM Symp. Theory of Comput., STOC ’04, 2004, pp. 81–90.
366. R. Andersen, F. Chung, K. Lang, Local graph partitioning using PageRank vectors, in: Proc. IEEE 47th Annual Symp. Found. Comput. Sci., FOCS ’06, 2006, pp. 475–486.
367. Spielman, D.A., Teng, S.H., A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM J. Comput. 42 (2013), 1–26.
368. K. Kloster, D.F. Gleich, Heat kernel based community detection, in: Proc. 20th ACM SIGKDD Intl. Conf. Knowledge Disc. Data Mining, KDD ’14, 2014, pp. 1386–1395.
369. I.M. Kloumann, J.M. Kleinberg, Community membership identification from small seed sets, in: Proc. 20th ACM SIGKDD Intl. Conf. Knowledge Disc. Data Mining, KDD ’14, 2014, pp. 1366–1375.
370. Kloumann, I.M., Ugander, J., Kleinberg, J., Block models and personalized PageRank. Proc. Natl. Acad. Sci. USA 114 (2017), 33–38.
371. Mucha, P.J., Porter, M.A., Communities in multislice voting networks. Chaos, 20, 2010, 041108.
372. Csermely, P., London, A., Wu, L.Y., Uzzi, B., Structure and dynamics of core/periphery networks. J. Compl. Netw. 1 (2013), 93–123.
373. Rombach, M.P., Porter, M.A., Fowler, J.H., Mucha, P.J., Core-periphery structure in networks. SIAM J. Appl. Math. 74 (2014), 167–190.
374. Della Rossa, F., Dercole, F., Piccardi, C., Profiling core-periphery network structure by random walkers. Sci. Rep., 3, 2013, 1467, 10.1038/srep01467.
375. Lee, J.A., Verleysen, M., Nonlinear Dimensionality Reduction. 2007, Springer, New York, NY.
376. De Domenico, M., Diffusion geometry unravels the emergence of functional clusters in collective phenomena. Phys. Rev. Lett., 118, 2017, 168301.
377. Heckathorn, D.D., Respondent-driven sampling: A new approach to the study of hidden populations. Soc. Prob. 44 (1997), 174–199.
378. Salganik, M.J., Heckathorn, D.D., Sampling and estimation in hidden populations using respondent-driven sampling. Sociol. Methodol. 34 (2004), 193–240.
379. Volz, E., Heckathorn, D.D., Probability based estimation theory for respondent driven sampling. J. Official Stat. 24 (2008), 79–97 http://www.jos.nu/articles/abstract.asp?article=241079.
380. McCarty, C., Killworth, P.D., Bernard, H.R., Johnsen, E.C., Shelley, G.A., Comparing two methods for estimating network size. Human Organ. 60 (2001), 28–39.
381. Marsden, P.V., Recent developments in network measurement. Models and Methods in Social Network Analysis, 2005, Cambridge University Press, Cambridge, UK, 8–30.
382. Rocha, L.E.C., Thorson, A.E., Lambiotte, R., Liljeros, F., Respondent-driven sampling bias induced by community structure and response rates in social networks. J. Roy. Statist. Soc. Ser. A 180 (2017), 99–118.
383. J. Malmros, L.E.C. Rocha, Multiple seed structure and disconnected networks in respondent-driven sampling, 2016, arXiv.org arXiv:1603.04222.
384. Lu, X., Bengtsson, L., Britton, T., Camitz, M., Kim, B.J., Thorson, A., Liljeros, F., The sensitivity of respondent-driven sampling. J. Roy. Statist. Soc. A 175 (2012), 191–216.
385. Malmros, J., Masuda, N., Britton, T., Random walks on directed networks: Inference and respondent-driven sampling. J. Off. Stat. 32 (2016), 433–459, 10.1515/jos-2016-0023.
386. Gile, K.J., Improved inference for respondent-driven sampling data with application to HIV prevalence estimation. J. Amer. Statist. Assoc. 106 (2011), 135–146.
387. Markov Chain Monte Carlo in Practice. Gilks, W.R., Richardson, S., Spiegelhalter, D.J., (eds.), 1996, Chapman & Hall, London, UK.
388. Stutzbach, D., Rejaie, R., Duffield, N., Sen, S., Willinger, W., On unbiased sampling for unstructured peer-to-peer networks. IEEE/ACM Trans. Netw. 17 (2009), 377–390.
389. M. Gjoka, M. Kurant, C.T. Butts, A. Markopoulou, Walking in facebook: A case study of unbiased sampling of OSNs, in: roc. 29th Conf. Info. Comm., 2010, INFOCOM ’10, pp. 2498–2506.
390. Liggett, T.M., Interacting Particle Systems. 1985, Springer, New York, NY, USA.
391. Durrett, D., Lecture Notes on Particle Systems and Percolation. 1988, Belmont, Wadsworth, CA, USA.
392. Castellano, C., Fortunato, S., Loreto, V., Statistical physics of social dynamics. Rev. Modern Phys. 81 (2009), 591–646.
393. Antal, T., Redner, S., Sood, V., Evolutionary dynamics on degree-heterogeneous graphs. Phys. Rev. Lett., 96, 2006, 188104.
394. Sood, V., Antal, T., Redner, S., Voter models on heterogeneous networks. Phys. Rev. E, 77, 2008, 041121.
395. Donnelly, P., Welsh, D., Finite particle systems and infection models. Math. Proc. Cambridge Philos. Soc. 94 (1983), 167–182, 10.1017/S0305004100060989.
396. d. Z. Wahrscheinlichkeitstheor. Verwandte Geb. 46 (1978), 55–65.
397. Cooper, C., Elsässer, R., Ono, H., Radzik, T., Coalescing random walks and voting on connected graphs. SIAM J. Discrete Math. 27 (2013), 1748–1758.
398. Masuda, N., Voter model on the two-clique graph. Phys. Rev. E, 90, 2014, 012802.
399. Iwamasa, Y., Masuda, N., Networks maximizing the consensus time of voter models. Phys. Rev. E, 90, 2014, 012816.
400. Abelson, R.P., Mathematical models of the distribution of attitudes under controversy. Frederiksen, N., Gulliksen, H., (eds.) Contributions To Mathematical Psychology, 1964, Holt, Rinehart and Winston, New York, NY, USA, 141–160.
401. DeGroot, M.H., Reaching a consensus. J. Amer. Statist. Assoc. 69 (1974), 118–121.
402. Jackson, M.O., Social and Economic Networks. 2008, Princeton University Press, Princeton, NJ, USA.
403. Olfati-Saber, R., Fax, J.A., Murray, R.M., Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95 (2007), 215–233.
404. Friedkin, N.E., Johnsen, E.C., Social Influence Network Theory: A Sociological Examination of Small Group Dynamics. 2011, Cambridge University Press, Cambridge, UK.
405. Jia, P., MirTabatabaei, A., Friedkin, N.E., Bullo, F., Opinion dynamics and the evolution of social power in influence networks. SIAM Rev. 57 (2015), 367–397.
406. Sznajd-Weron, K., Sznajd, J., Opinion evolution in closed community. Internat. J. Modern Phys. C 11 (2000), 1157–1165.
407. Krapivsky, P.L., Redner, S., Dynamics of majority rule in two-state interacting spin systems. Phys. Rev. Lett., 90(23), 2003, 238701.
408. Schweitzer, F., Behera, L., Nonlinear voter models: The transition from invasion to coexistence. Eur. Phys. J. B 67 (2009), 301–318.
409. Shao, J., Havlin, S., Stanley, H.E., Dynamic opinion model and invasion percolation. Phys. Rev. Lett., 103, 2009, 018701.
410. Rodrigues, F.A., Peron, T.K.D., Ji, P., Kurths, J., The Kuramoto model in complex networks. Phys. Rep. 610 (2016), 1–98.
411. Gfeller, D., De Los Rios, P., Spectral coarse graining of complex networks. Phys. Rev. Lett., 99, 2007, 038701.
412. Gfeller, D., De Los Rios, P., Spectral coarse graining and synchronization in oscillator networks. Phys. Rev. Lett., 100, 2008, 174104.
413. O'Clery, N., Yuan, Y., Stan, G.B., Barahona, M., Observability and coarse graining of consensus dynamics through the external equitable partition. Phys. Rev. E, 88, 2013, 042805.
414. Pecora, L.M., Sorrentino, F., Hagerstrom, A.M., Murphy, T.E., Roy, R., Cluster synchronization and isolated desynchronization in complex networks with symmetries. Nat. Comm., 5, 2014, 4079, 10.1038/ncomms5079.
415. L. Li, W.M. Campbell, R.S. Caceres, Graph model selection via random walks, 2017, https://arxiv.org/abs/1704.05516.
416. K. Henderson, B. Gallagher, T. Eliassi-Rad, H. Tong, S. Basu, L. Akoglu, D. Koutra, C. Faloutsos, L. Li, RolX: Structural role extraction & mining in large graphs, in: Proc. 18th ACM SIGKDD Intl. Conf. Knowledge Disc. Data Mining, KDD ’12, 2012, pp. 1231–1239.
417. Zhou, S., Mondragón, R.J., The rich-club phenomenon in the Internet topology. IEEE Commun. Lett. 8 (2004), 180–182.
418. Colizza, V., A. Flammini, M. A. Serrano, Vespignani, A., Detecting rich-club ordering in complex networks. Nat. Phys. 2 (2006), 110–115, 10.1038/nphys209.
419. Newman, M.E.J., Leicht, E.A., Mixture models and exploratory analysis in networks. Proc. Natl. Acad. Sci. USA 104 (2007), 9564–9569.
420. Wu, T., Benson, A.R., Gleich, D.F., General tensor spectral co-clustering for higher-order data. Lee, D.D., Sugiyama, M., Luxburg, U.V., (eds.) Advances in Neural Information Processing Systems, vol. 29, 2016, Curran Associates, Inc., 2559–2567 https://arxiv.org/abs/1603.00395.
421. Lu, L., Peng, X., High-ordered random walks and generalized laplacians on hypergraphs. Lecture Notes in Comput. Sci. 6732 (2011), 14–25.
422. Mukherjee, S., Steenbergen, J., Random walks on simplicial complexes and harmonics. Random Structures Algorithms 49 (2016), 379–405.
423. Nicosia, V., Skardal, P.S., Arenas, A., Latora, V., Collective phenomena emerging from the interactions between dynamical processes in multiplex networks. Phys. Rev. Lett., 118, 2017, 138302.
424. G. Han, H. Sethu, Waddling random walk: Fast and accurate mining of motif statistics in large graphs, in: Sixteenth IEEE Intl. Conf. Data Mining, ICDM 2016, 2016, pp. 181–190.
425. Tria, F., Loreto, V., Servedio, V.D.P., Strogatz, S.H., The dynamics of correlated novelties. Sci. Rep., 4, 2014, 5890, 10.1038/srep05890.