Journal
RANDOM STRUCTURES & ALGORITHMS
Volume 60, Issue 2, Pages 201-232Publisher
WILEY
DOI: 10.1002/rsa.21027
Keywords
community detection; continuous time branching processes; inhomogeneous random trees; multitype branching processes; random recursive trees; stochastic block model
Funding
- NSF [DMS-1638521, DMS-1606839, DMS-1613072]
- Army Research Office [W911NF-17-1-0010]
- Statistical and Applied Mathematical Sciences Institute
Ask authors/readers for more resources
The article focuses on random recursive trees grown by community modulated schemes involving random attachment or degree based attachment. General techniques based on continuous time embedding are derived to study these models. Through stochastic analytic techniques, it is shown that key macroscopic statistics of the continuous time embeddings stabilize, allowing asymptotics for various characteristics of the original models to be obtained.
We consider random recursive trees that are grown via community modulated schemes that involve random attachment or degree based attachment. The aim of this article is to derive general techniques based on continuous time embedding to study such models. The associated continuous time embeddings are not branching processes: individual reproductive rates at each time t depend on the composition of the entire population at that time, and hence vertices do not reproduce independently. Using stochastic analytic techniques we show that various key macroscopic statistics of the continuous time embedding stabilize, allowing asymptotics for a host of functionals of the original models to be derived.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available