Degree Distributions in Recursive Trees with Fitnesses
Tejas Iyer

TL;DR
This paper analyzes a recursive tree model with fitness-based attachment, deriving limiting degree and weight distributions, and explores phenomena like condensation and degenerate distributions, extending understanding of complex network growth.
Contribution
It provides explicit formulas for degree and weight distributions in recursive trees with fitness, including cases with condensation and degenerate limits, using branching process theory.
Findings
Derived almost sure limiting distributions for degrees and weights.
Proved condensation phenomena where edges concentrate on high-weight vertices.
Established stochastic convergence of degree distribution under strong law assumptions.
Abstract
We study a general model of recursive trees where vertices are equipped with independent weights and at each time-step a vertex is sampled with probability proportional to its fitness function (a function of its weight and degree) and connects to new-coming vertices. Under a certain technical assumption, applying the theory of Crump-Mode-Jagers branching processes, we derive formulas for the almost sure limiting distribution of the proportion of vertices with a given degree and weight, and proportion of edges with endpoint having a certain weight. As an application of this theorem, we prove rigorously observations of Bianconi related to the evolving Cayley tree in []. We also study the process in depth when the technical condition can fail in the particular case when the fitness function is affine, a model we call…
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 · Economic theories and models
