Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point

DOI10.1214/22-aap1881arXiv1808.02439MaRDI QIDQ6165244

Sayan Banerjee, Shankar Bhamidi, Iain Carmichael

Publication date: 31 July 2023

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

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

zbMATH Keywords

random networkstemporal networkschange point detectioncontinuous time branching processesMalthusian rate of growthstable age distribution theoryinhomogeneous branching processes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

Degree centrality and root finding in growing random 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
• Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
• Limit theorems for sums determined by branching and other exponentially growing processes
• Asymptotic fringe distributions for general families of random trees
• Random recursive trees and the Bolthausen-Sznitman coalescent
• Estimating the number of change-points via Schwarz' criterion
• Tail bounds for sums of geometric and exponential variables
• Change point detection in network models: preferential attachment and long range dependence
• Persistence of hubs in growing random networks
• Root finding algorithms and persistence of Jordan centrality in growing random trees
• Degree distribution nearby the origin of a preferential attachment graph
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• The degree sequence of a scale-free random graph process
• Random Graphs and Complex 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
• Polya Urn Models
• Random Trees
• On the convergence of supercritical general (C-M-J) branching processes
• Markov Chains
• The Structure and Function of Complex Networks
• Estimating and Testing Linear Models with Multiple Structural Changes
• The strong convergence of maximal degrees in uniform random recursive trees and dags
• Quantitative exponential bounds for the renewal theorem with spread-out distributions
• Asymptotic normality of degree counts in a preferential attachment model
• Circular binary segmentation for the analysis of array-based DNA copy number data
• A Modified Bayes Information Criterion with Applications to the Analysis of Comparative Genomic Hybridization Data
• Random trees and general branching processes
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• Networks