Components of Random Forests

DOI10.1017/S0963548300000067zbMath0793.05109OpenAlexW2113381838MaRDI QIDQ4291184

Tomasz Łuczak, Boris G. Pittel

Publication date: 10 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000067

zbMATH Keywords

random graphlimit distributionforestrandom forestgiant tree

Mathematics Subject Classification ID

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

Related Items (13)

The wired arboreal gas on regular trees ⋮ Phase transition phenomena in random discrete structures ⋮ Random spanning forests and hyperbolic symmetry ⋮ Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022 ⋮ Parking on Cayley trees and frozen Erdős-Rényi ⋮ Spin systems with hyperbolic symmetry: a survey ⋮ Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation ⋮ Forests on wired regular trees ⋮ Critical random forests ⋮ On finding a minimum spanning tree in a network with random weights ⋮ Coalescent random forests ⋮ Two critical periods in the evolution of random planar graphs ⋮ On the largest component of the random graph at a nearcritical stage

Cites Work

• Unnamed Item
• A case of limit distribution of the maximal volume of a tree in a random forest
• The average height of binary trees and other simple trees
• The expected linearity of a simple equivalence algorithm
• Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel
• The asymptotic behaviour of coefficients of powers of certain generating functions
• On the Expected Performance of Path Compression Algorithms
• The Evolution of Random Graphs
• On Some Features of the Structure of a Random Graph Near a Critical Point
• A Random Graph With a Subcritical Number of Edges
• A Recurrence Related to Trees
• Polymerisation processes with intrapolymer bonding. I. one type of unit
• A random tree model associated with random graphs
• On tree census and the giant component in sparse random graphs
• The Asymptotic Distribution of Maximum Tree Size in a Random Forest
• On the Altitude of Nodes in Random Trees
• Big Buckets Are (Are Not) Better!
• A Graph-Valued Markov Process as Rings-Allowed Polymerization Model: Subcritical Behavior
• On the Behavior of a Random Graph Near a Critical Point
• Linear probing: The probable largest search time grows logarithmically with the number of records
• The distance between points in random trees
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• Structure of the Random Graphs $\mathcal{G}_m (x|h)$

This page was built for publication: Components of Random Forests