Determining Factors Behind the PageRank Log-Log Plot
From MaRDI portal
Publication:5458304
DOI10.1007/978-3-540-77004-6_9zbMath1136.68339arXiv0704.2694OpenAlexW1865446091MaRDI QIDQ5458304
Debora Donato, Nelly Litvak, Yana Volkovich
Publication date: 11 April 2008
Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0704.2694
Related Items (9)
PageRank in Scale-Free Random Graphs ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Tail behavior of solutions of linear recursions on trees ⋮ Approximating PageRank from In-Degree ⋮ Probabilistic Relation between In-Degree and PageRank ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ Asymptotic analysis for personalized Web search ⋮ Information ranking and power laws on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of max-type recursive distributional equations
- Asymptotic properties and absolute continuity of laws stable by random weighted mean.
- Emergence of Scaling in Random Networks
- Authoritative sources in a hyperlinked environment
- RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
- Approximating PageRank from In-Degree
- Deeper Inside PageRank
- THE INSPECTION PARADOX
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- The Effect of New Links on Google Pagerank
- PageRank of Scale-Free Growing Networks
- Regularly varying functions
This page was built for publication: Determining Factors Behind the PageRank Log-Log Plot