Ancestors and descendants in evolving k‐tree models

DOI10.1002/rsa.20474zbMath1296.05177OpenAlexW2169710518MaRDI QIDQ5495877

Alois Panholzer, Georg Seitz

Publication date: 7 August 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20474

zbMATH Keywords

limiting distributionsdescendantsancestorsincreasing \(k\)-trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items

On moment sequences and mixed Poisson distributions, On maximum Estrada indices of \(k\)-trees, Justifying the small-world phenomenon via random recursive trees, On the signless Laplacian spectra of \(k\)-trees, On maximum signless Laplacian Estrada indices of \(k\)-trees, The degree profile and weight in Apollonian networks and k-trees, The height of random k‐trees and related branching processes

Cites Work

• Unnamed Item
• Unnamed Item
• Descendants in increasing trees
• The degree distribution of random \(k\)-trees
• Some families of increasing planar maps
• On convergence rates in the central limit theorems for combinatorial structures
• Descendants in heap ordered trees or a triumph of computer algebra
• Emergence of Scaling in Random Networks
• Random Trees
• Poisson approximations for functionals of random trees
• Collective dynamics of ‘small-world’ networks
• Level of nodes in increasing trees revisited
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees
• The number of labeled k-trees