RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK

DOI10.1142/S0218127407018439zbMath1142.60342arXivphysics/0604203OpenAlexW2062680454MaRDI QIDQ3511043

Santo Fortunato, Alessandro Flammini

Publication date: 4 July 2008

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/physics/0604203

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Network design and communication in computer systems (68M10) Paths and cycles (05C38) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (6)

Probabilistic Relation between In-Degree and PageRank ⋮ Rethinking centrality: the role of dynamical processes in social network analysis ⋮ A model of self‐avoiding random walks for searching complex networks ⋮ Asymptotic analysis for personalized Web search ⋮ Distribution of PageRank Mass Among Principle Components of the Web ⋮ Determining Factors Behind the PageRank Log-Log Plot

Cites Work

• Complex networks: structure and dynamics
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Unnamed Item

This page was built for publication: RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK