Distribution of nodes of a tree by degree

DOI10.1016/0025-5564(70)90071-4zbMath0193.53501OpenAlexW1974468302MaRDI QIDQ2538631

H. S. Na, Anatol Rapoport

Publication date: 1970

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/32846

zbMATH Keywords

topology

Related Items

Isolating the most recent entry in a random recursive tree by random cuts ⋮ On leaf related statistics in recursive tree models ⋮ Depth Properties of scaled attachment random recursive trees ⋮ High degrees in recursive trees ⋮ Note on the heights of random recursive trees and random m‐ary search trees ⋮ On the number of leaves in a random recursive tree ⋮ Degree distributions in recursive trees with fitnesses ⋮ Long and short paths in uniform random recursive dags ⋮ On the complexity of algorithms on recursive trees ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ Markov branching in the vertex splitting model ⋮ Emergent network modularity ⋮ BUILDING RANDOM TREES FROM BLOCKS ⋮ Depth of vertices with high degree in random recursive trees ⋮ Limit laws for local counters in random binary search trees ⋮ Asymptotic joint normality of counts of uncorrelated motifs in recursive trees ⋮ A non-increasing tree growth process for recursive trees and applications ⋮ Dynamical models for random simplicial complexes ⋮ Correction terms for the height of weighted recursive trees ⋮ An involution on increasing trees ⋮ Cutting down recursive trees ⋮ On joint properties of vertices with a given degree or label in the random recursive tree ⋮ Limit distribution for the maximum degree of a random recursive tree

Cites Work

• On nodes of degree two in random trees
• Unnamed Item
• Unnamed Item