Random walks on directed networks: The case of pagerank

International Journal of Bifurcation and Chaos

Volumn 17, Issue 7, 2007, Pages 2343-2353

  Fortunato, Santo ^b,c   Flammini, Alessandro ^a  

^a INDIANA UNIVERSITY   (United States)

^b ISI FOUNDATION   (Italy)

^c BIELEFELD UNIVERSITY   (Germany)

Author keywords

Networks; Random walks

Indexed keywords

DAMPING; GRAPH THEORY;

IN-DEGREE DISTRIBUTION; NETWORKS; RANDOM WALKS; STATIONARY PROBABILITY;

WEBSITES;

EID: 34548477455     PISSN: 02181274     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218127407018439     Document Type: Article

References (19)

1. Albert, R., Jeong, H. & Barabási, A.-L. [2000] "Diameter of the World-Wide Web," Nature 406, 378-382.
2. Albert, S. & Barabási, A.-L. [2002] "Statistical mechanics of complex networks," Rev. Mod. Phys. 74, 47-97.
3. Barabási, A.-L. & Albert, R. [1999] "Emergence of scaling in random networks," Science 286, 509-512.
4. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M. & Hwang, D.-U. [2006] "Complex networks: Structure and dynamics," Phys. Rep. 424, 175-308.
5. Boldi, P., Santini, M. & Vigna, S. [2005] "PageRank as a function of the damping factor," in Proc. Fourteenth Int. World Wide Web Conf., Chiba, Japan, ACM Press, pp. 557-566.
6. Brin, S. & Page, L. [1998] "The anatomy of a large-scale hypertextual Web search engine," Comput. Networks 30, 107-117.
7. Chen, P., Xie, H., Maslov, S. & Redner, S. [2006] "Finding scientific gems with Google," Technical Report, physics/0604130 at www.arXiv.org.
8. Dorogovtsev, S. N., Mendes, J. F. F. & Samukhin, A. N. [2000] "Structure of growing networks with preferential linking," Phys. Rev. Lett. 85, 4633-4636.
9. Dorogovtsev, S. N. & Mendes, J. F. F. [2002] "Evolution of networks", Adv. Phys. 51, 1079-1187.
10. Erdös, P. & Rényi, A. [1959] "On random graphs I," Publ. Math. Debrecen 6, 290-297.
11. Fortunato, S., Boguñá, M., Flammini, A. & Menczer, F. [2005] "How to make the top ten: Approximating PageRank from in-degree," Technical Report, cs.IR/0511016 at www.arXiv.org.
12. Hall, B. H., Jaffe, A. B. & Tratjenberg, M. [2001] "The NBER patent citation data file: Lessons, insights and methodological tools.," NBER Working Paper 8498.
13. Hughes, B. D. [1995] Random Walks and Random Environments, Random Walks, Vol. 1 (Oxford University Press, NY).
14. Kleinberg, J., Kumar, S. R., Raghavan, P., Rajagopalan, S. & Tomkins, A. [1999] "The Web as a graph: Measurements, models and methods," LNCS 1627, 1-18.
15. Krapivsky, P. L. & Redner, S. [2001] "Organization of growing random networks," Phys. Rev. E 63, 066123.
16. Newman, M. E. J. [2003] "The structure and function of complex networks," SIAM Rev. 45, 167-256.
17. Pandurangan, G., Raghavan, P. & Upfal, E. [2002] "Using pagerank to characterize Web structure," in Proc. 8th Ann. Int. Conf. Combinatorics and Computing (COCOON), (Springer-Verlag, Singapore), pp. 330-339.
18. Pastor-Satorras, R. & Vespignani, A. [2004] Evolution and Structure of the Internet (Cambridge University Press, Cambridge, UK), Chap. 7, pp. 148-156.
19. Pearson, K. [1905] "The problem of the random walk," Nature 72, 294.