The PageRank vector of a scale-free web network growing by preferential attachment

DOI10.1007/978-3-030-92507-9_3zbMath1498.68024OpenAlexW4206143586MaRDI QIDQ2151326

Udo R. Krieger, Natalia M. Markovich

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92507-9_3

zbMATH Keywords

scale-free networkPageRank vectorlinear preferential attachment

Mathematics Subject Classification ID

Internet topics (68M11)

Cites Work

• Are extreme value estimation methods useful for network data?
• Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
• PageRank in Scale-Free Random Graphs
• Approximating PageRank from In-Degree
• Deeper Inside PageRank
• PageRank of Scale-Free Growing Networks
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?
• On Local Estimations of PageRank: A Mean Field Approach

This page was built for publication: The PageRank vector of a scale-free web network growing by preferential attachment