Sizes of trees in a random forest and configuration graphs

DOI10.1134/S0081543822010205zbMath1487.05081OpenAlexW4225146336MaRDI QIDQ2135141

Yuriy L. Pavlov, I. A. Cheplyukova

Publication date: 4 May 2022

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543822010205

zbMATH Keywords

Galton-Watson random forests

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Distance in graphs (05C12) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (1)

On the Number of Trees of a Given Size in a Galton--Watson Forest in the Critical Case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Random Graphs and Complex Networks
• Limit distributions of the number of trees of a given size in a random forest
• Local Limit Theorems for Lattice Random Variables
• A remark on the Galton-Watson forests
• The maximum tree of a random forest in the configuration graph
• The total progeny in a branching process and a related random walk

This page was built for publication: Sizes of trees in a random forest and configuration graphs