Persistence of hubs in growing random networks

DOI10.1007/s00440-021-01066-0zbMath1491.60015arXiv2004.13785OpenAlexW3171709890MaRDI QIDQ2041655

Sayan Banerjee, Shankar Bhamidi

Publication date: 23 July 2021

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

persistencefunctional central limit theoremsmoderate deviationstemporal networkscontinuous time branching processesnetwork centrality measuresgeneralized attachment networksmartingale concentration inequalities

Mathematics Subject Classification ID

Applications of branching processes (60J85) Combinatorial probability (60C05) Applications of continuous-time Markov processes on discrete state spaces (60J28)

Related Items (7)

Persistence in complex systems ⋮ Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Steady and ranging sets in graph persistence ⋮ 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 ⋮ Depth of vertices with high degree in random recursive trees ⋮ Pagerank asymptotics on directed preferential attachment networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits and influence of the seed graph in preferential attachment trees
• Proofs of the martingale FCLT
• Random networks with sublinear preferential attachment: degree evolutions
• Limit distribution for the maximum degree of a random recursive tree
• Nonextensive condensation in reinforced branching processes
• Degree asymptotics with rates for preferential attachment random graphs
• From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
• Finding the seed of uniform attachment trees
• 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
• On the convergence of supercritical general (C-M-J) branching processes
• Component behavior near the critical point of the random graph process
• High degrees in random recursive trees
• Persistence of centrality in random growing trees
• The Maximum Degree of the Barabási–Albert Random Tree
• The strong convergence of maximal degrees in uniform random recursive trees and dags
• Rumors in a Network: Who's the Culprit?
• Connectivity Transitions in Networks with Super-Linear Preferential Attachment
• 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

This page was built for publication: Persistence of hubs in growing random networks