Root finding algorithms and persistence of Jordan centrality in growing random trees

DOI10.1214/21-AAP1731zbMath1503.05107arXiv2006.15609OpenAlexW3037680033WikidataQ113240928 ScholiaQ113240928MaRDI QIDQ2170374

Shankar Bhamidi, Sayan Banerjee

Publication date: 5 September 2022

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random treescentrality measurestemporal networksrecursive distributional equationsCrump-Mode-Jagers processescontinuous time branching processesJordan centralityMalthusian rate of growthstable age distribution theory

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Degree centrality and root finding in growing random networks ⋮ Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits and influence of the seed graph in preferential attachment trees
• Random networks with sublinear preferential attachment: degree evolutions
• A fixed point theorem for distributions
• Seneta-Heyde norming in the branching random walk
• On generalized multiplicative cascades
• Asymptotic properties and absolute continuity of laws stable by random weighted mean.
• Persistence of hubs in growing random networks
• Correlated randomly growing graphs
• Discrete minimax estimation with trees
• Thin tails of fixed points of the nonhomogeneous smoothing transform
• Elementary fixed points of the BRW smoothing transforms with infinite number of summands
• Finding the seed of uniform attachment trees
• Random Graphs and Complex Networks
• A Guide to Temporal Networks
• Finding Adam in random growing trees
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The growth and composition of branching populations
• Random Trees
• Continuity of limit random variables in the branching random walk
• On the convergence of supercritical general (C-M-J) branching processes
• Component behavior near the critical point of the random graph process
• Markov Chains
• The Structure and Function of Complex Networks
• Persistence of centrality in random growing trees
• Fixed points of the smoothing transformation
• Rumors in a Network: Who's the Culprit?
• 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
• Networks
• A probabilistic approach to the leader problem in random graphs

This page was built for publication: Root finding algorithms and persistence of Jordan centrality in growing random trees