Community modulated recursive trees and population dependent branching processes

We consider random recursive trees that are grown via community modulated schemes that involve random attachment or degree based attachment. The aim of this paper 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 depend on the composition of the entire population at that time. 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.

[1]  Boris G. Pittel,et al.  Note on the Heights of Random Recursive Trees and Random m-ary Search Trees , 1994, Random Struct. Algorithms.

[2]  J. Gastwirth.  A Probability Model of a Pyramid Scheme , 1977 .

[3]  Alʹbert Nikolaevich Shiri︠a︡ev,et al.  Theory of martingales , 1989 .

[4]  C. C. Heyde,et al.  On the number of terminal vertices in certain random trees with an application to stemma construction in philology , 1982, Journal of Applied Probability.

[5]  A. Gionis,et al.  Communities , 2019, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[6]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[7]  P. L. Krapivsky,et al.  The power of choice in growing trees , 2007, 0704.1882.

[8]  Luc Devroye,et al.  Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms , 1998 .

[9]  Sebastian Rosengren.  A Multi-type Preferential Attachment Model , 2017 .

[10]  Luc Devroye,et al.  The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags , 1995, Random Struct. Algorithms.

[11]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[12]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[13]  K. Athreya,et al.  Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems , 1968 .

[14]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  M. Newman.  Communities, modules and large-scale structure in networks , 2011, Nature Physics.

[16]  Luc Devroye,et al.  Finding Adam in random growing trees , 2014, Random Struct. Algorithms.

[17]  Ioannis Karatzas,et al.  Brownian Motion and Stochastic Calculus , 1987 .

[18]  Laurent Massoulié,et al.  Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[19]  Hosam M. Mahmoud.  The Power of Choice in the Construction of Recursive Trees , 2010 .

[20]  B. Øksendal.  Stochastic Differential Equations , 1985 .

[21]  Sebastian Rosengren,et al.  A Multi-type Preferential Attachment Tree , 2017, Internet Math..

[22]  A. Nobel,et al.  Change point detection in Network models: Preferential attachment and long range dependence , 2015, 1508.02043.

[23]  Luc Devroye,et al.  Depth Properties of scaled attachment random recursive trees , 2012, Random Struct. Algorithms.

[24]  Joseph L. Gastwirth,et al.  Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable , 1984, Oper. Res..

[25]  Maria Deijfen,et al.  Birds of a feather or opposites attract - effects in network modelling , 2016, Internet Math..

[26]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[27]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[28]  J. Biggins.  THE FIRST- AND LAST-BIRTH PROBLEMS FOR A MULTITYPE AGE-DEPENDENT BRANCHING PROCESS , 1976 .

[29]  J. Moon,et al.  Combinatorics: The distance between nodes in recursive trees , 1974 .

[30]  David Aldous,et al.  Asymptotic Fringe Distributions for General Families of Random Trees , 1991 .

[31]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[32]  Hosam M. Mahmoud,et al.  Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees , 1992, Random Struct. Algorithms.

[33]  Charles J. Mode,et al.  A general age-dependent branching process. II , 1968 .

[34]  Svante Janson.  Asymptotic degree distribution in random recursive trees , 2005 .

[35]  Luc Devroye,et al.  Branching processes in the analysis of the heights of trees , 1987, Acta Informatica.