Leaves of preferential attachment trees
Abstract
We provide a local probabilistic description of the limiting statistics of large preferential attachment trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are leaves). The full description is the joint degree-leafdegree distribution nk,, which we derive from its associated multivariate generating function. From nk, we obtain the leafdegree distribution, m, as well as the fraction of vertices that are protected (nonleaves with leafdegree zero) as a function of degree, nk,0, among numerous other results. We also examine fluctuations and concentration of joint degree-leafdegree empirical counts Nk,. Although our main findings pertain to the preferential attachment tree, the approach we present is highly generalizable and can characterize numerous existing models, in addition to facilitating the development of tractable new models. We further demonstrate the approach by analyzing nk, in two other models: the random recursive tree, and a redirection-based model.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.