On the maximal size of tree in a random forest

Abstract Galton-Watson forests consisting of N rooted trees and n non-root vertices are considered. The distribution of the forest is determined by that of critical branching process with infinite variance and regularly varying tail of the progeny distribution. We prove limit theorem for the maximal size of a tree in a forest as N , n → ∞ in such a way that n/N → ∞. Our conditions are significantly wider than was previously known.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics and Applications
Published
2024-08-01
DOI
https://doi.org/10.1515/dma-2024-0019
Citations
1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the maximal size of tree in a random forest

Yuriy L. Pavlov
1 citations
Discrete Mathematics and Applications
Complex Network Analysis Techniques
0.28
article

On the maximal size of tree in a random forest

Yuriy L. Pavlov
article en
1 citations

Abstract

Abstract Galton-Watson forests consisting of N rooted trees and n non-root vertices are considered. The distribution of the forest is determined by that of critical branching process with infinite variance and regularly varying tail of the progeny distribution. We prove limit theorem for the maximal size of a tree in a forest as N , n → ∞ in such a way that n/N → ∞. Our conditions are significantly wider than was previously known.

Discrete Mathematics and ApplicationsVol. 34(4)
Karelian Research Centre (RU)
Life in Land
Openalex Percentile: Top 46%
Complex Network Analysis Techniques
0.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On the maximal size of tree in a random forest — Yuriy L. Pavlov · Discrete Mathematics and Applications (2024) | TGRS Research Map | TGRS