In age-biased attachment graphs, the descendant tree of a fixed root has a beta mixture limit for one attachment per vertex and reaches nearly the whole vertex set for multiple attachments, with matching and independent set greedy limits also derived.
Bollob´ as,Random Graphs, 2nd Edition (2001)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Giant descendant trees, matchings and independent sets in the age-biased attachment graphs
In age-biased attachment graphs, the descendant tree of a fixed root has a beta mixture limit for one attachment per vertex and reaches nearly the whole vertex set for multiple attachments, with matching and independent set greedy limits also derived.