Degree centrality and root finding in growing random networks
DOI10.1214/23-ejp930zbMath1517.05162arXiv2105.14087OpenAlexW4324122551MaRDI QIDQ6164921
Sayan Banerjee, Xiangying Huang
Publication date: 4 July 2023
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.14087
persistencedegree centralityroot finding algorithmscontinuous time branching processesnetwork centrality measuresattachment functions
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of branching processes (60J85) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85) Applications of continuous-time Markov processes on discrete state spaces (60J28)
Cites Work
- Scaling limits and influence of the seed graph in preferential attachment trees
- Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
- Looking for vertex number one
- Random networks with sublinear preferential attachment: degree evolutions
- The first birth problem for an age-dependent branching process
- Asymptotic properties and absolute continuity of laws stable by random weighted mean.
- Persistence of hubs in growing random networks
- Geometry of weighted recursive and affine preferential attachment trees
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- Discrete minimax estimation with trees
- Moments of general time dependent branching processes with applications
- 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
- The degree sequence of a scale-free random graph process
- Finding Rumor Sources on Random Trees
- Finding Adam in random growing trees
- The growth and composition of branching populations
- Continuity of limit random variables in the branching random walk
- On the convergence of supercritical general (C-M-J) branching processes
- Chernoff's theorem in the branching random walk
- From trees to graphs: collapsing continuous-time branching processes
- Persistence of centrality in random growing trees
- Axioms for Centrality
- Joint degree distributions of preferential attachment random graphs
- 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
- Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point
This page was built for publication: Degree centrality and root finding in growing random networks
