PageRank in Scale-Free Random Graphs

DOI10.1007/978-3-319-13123-8_10zbMath1342.05136arXiv1408.3610MaRDI QIDQ2945278

Mariana Olvera-Cravioto, Nelly Litvak, Ningyuan Chen

Publication date: 9 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

tree approximation; distribution of PageRank on a directed configuration model

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68M11: Internet topics

Related Items

Robustness of power-law behavior in cascading line failure models, Statistical Clustering of a Random Network by Extremal Properties, Rankings in directed configuration models with heavy tailed in-degrees, The PageRank vector of a scale-free web network growing by preferential attachment, Local weak convergence for PageRank, Maxima and sums of non-stationary random length sequences, Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model

Cites Work

• Unnamed Item
• Unnamed Item
• Tail behavior of solutions of linear recursions on trees
• Implicit renewal theorem for trees with general weights
• Fixed points of the smoothing transform: two-sided solutions
• Random Graphs and Complex Networks
• Precise Tail Index of Fixed Points of the Two-Sided Smoothing Transform
• Implicit Renewal Theory and Power Tails on Trees
• Information ranking and power laws on trees
• Asymptotic analysis for personalized Web search
• Directed random graphs with given degree distributions
• Generalized PageRank on directed configuration networks
• Determining Factors Behind the PageRank Log-Log Plot
• PageRank of Scale-Free Growing Networks
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?