Fluctuation Bounds for Continuous Time Branching Processes and Evolution of Growing Trees With a Change Point
Sayan Banerjee, Shankar Bhamidi, Iain Carmichael

TL;DR
This paper studies the evolution of random trees with a change point in attachment rules, providing deterministic degree distribution approximations, change point estimators, and analyzing effects of change points in different time scales.
Contribution
It introduces new methods for analyzing inhomogeneous continuous-time branching processes and applies them to understand change points in growing random trees.
Findings
Deterministic approximations for degree distributions in the standard model.
Consistent non-parametric estimator for the change point.
Effect of pre-change dynamics diminishes in degree distribution but persists in maximal degree.
Abstract
We consider dynamic random trees constructed using an attachment function where, at each step of the evolution, a new vertex attaches to an existing vertex in the current tree with probability proportional to (degree(v)). We explore the effect of a change point in the system; the dynamics are initially driven by a function f until the tree reaches size , at which point the attachment function switches to another function, , until the tree reaches size . Two change point time scales are considered, namely the standard model where , and the quick big bang model where , for some . In the former case, we obtain deterministic approximations for the evolution of the empirical degree distribution (EDF) in sup-norm and use these to devise a provably consistent non-parametric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Complex Network Analysis Techniques
