Pagerank asymptotics on directed preferential attachment networks
DOI10.1214/21-AAP1757zbMath1498.05237arXiv2102.08894OpenAlexW3132989961MaRDI QIDQ2083275
Sayan Banerjee, Mariana Olvera-Cravioto
Publication date: 10 October 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.08894
power lawscomplex networksPageRankcontinuous time branching processeslocal weak limitsdirected preferential attachment
Searching and sorting (68P10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Random graphs (graph-theoretic aspects) (05C80) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Convergence of probability measures (60B10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tail behavior of solutions of linear recursions on trees
- Fast distributed PageRank computation
- Limit theorems for sums determined by branching and other exponentially growing processes
- Recurrence of distributional limits of finite planar graphs
- PageRank on inhomogeneous random digraphs
- Persistence of hubs in growing random networks
- Local weak convergence for PageRank
- PageRank's behavior under degree correlations
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Processes on unimodular random networks
- PageRank Beyond the Web
- Random Graphs and Complex Networks
- Information ranking and power laws on trees
- Emergence of Scaling in Random Networks
- The growth and composition of branching populations
- Approximating PageRank from In-Degree
- Asymptotic analysis for personalized Web search
- Jordan Canonical Form: Application to Differential Equations
- On the convergence of supercritical general (C-M-J) branching processes
- From trees to graphs: collapsing continuous-time branching processes
- Asymptotic degree distribution in random recursive trees
- Directed preferential attachment models: Limiting degree distributions and their tails
- Generalized PageRank on directed configuration networks
- Random trees and general branching processes
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- Existence of a persistent hub in the convex preferential attachment model
- PageRank of Scale-Free Growing Networks
- Probability theory. A comprehensive course
This page was built for publication: Pagerank asymptotics on directed preferential attachment networks
