PageRank of Scale-Free Growing Networks

DOI10.1080/15427951.2006.10129120zbMath1122.68406OpenAlexW2001641889MaRDI QIDQ5755206

Dmitri Lebedev, Konstantin E. Avrachenkov

Publication date: 20 August 2007

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2006.10129120

Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10)

Related Items (12)

ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ The PageRank vector of a scale-free web network growing by preferential attachment ⋮ Local weak convergence for PageRank ⋮ PageRank in Scale-Free Random Graphs ⋮ Towards Google matrix of brain ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Probabilistic Relation between In-Degree and PageRank ⋮ PageRank on inhomogeneous random digraphs ⋮ Mean field analysis of personalized PageRank with implications for local graph clustering ⋮ Asymptotic analysis for personalized Web search ⋮ Determining Factors Behind the PageRank Log-Log Plot ⋮ Pagerank asymptotics on directed preferential attachment networks

This page was built for publication: PageRank of Scale-Free Growing Networks