Results 11 to 20 of about 2,906,539 (296)
Random trees in random graphs [PDF]
We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled n n -vertex trees, in two senses.
N. C. Wormald, E. A. Bender
core +3 more sources
Tree limits and limits of random trees [PDF]
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees, for split trees
Janson, Svante, +2 more
core +4 more sources
Automorphisms of Random Trees [PDF]
We study the size of the automorphism group of two different types of random trees: Galton-Watson trees and Pólya trees. In both cases, we prove that it asymptotically follows a log-normal distribution.
Olsson, Christoffer +3 more
core +5 more sources
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching.
Janson, Svante,, SVANTE JANSON
core +5 more sources
Models of random spanning trees [PDF]
There are numerous randomized algorithms to generate spanning trees in a given ambient graph; several target the uniform distribution on trees (UST), while in practice the fastest and most frequently used draw random weights on the edges and then employ ...
Babson, Eric +7 more
core +4 more sources
RANDOM WALKS AND DIMENSIONS OF RANDOM TREES
We study the relationship between the type of the random walk on some random trees and the structure of those trees in terms of fractal and resistance dimensions. This paper generalizes some results of Refs. 8–10.
MOKHTAR H. KONSOWA
core +2 more sources
Broadcasting induced colourings of random recursive trees and preferential attachment trees [PDF]
In this work we consider random two-colourings of random linear preferential attachment trees, which includes random recursive trees, random plane-oriented recursive trees, random binary search trees, and a class of random $d$-ary trees.
Desmarais, Colin +8 more
core +2 more sources
Extremely randomized trees [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geurts, Pierre +2 more
openaire +6 more sources
Parking on a Random Tree [PDF]
Consider a uniform random rooted labelled tree on n vertices. We imagine that each node of the tree has space for a single car to park. A number m ≤ n of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path towards the root until it ...
Christina Goldschmidt, Michal Przykucki
openaire +4 more sources
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
We consider the model of random trees introduced by Devroye, the so-called random split trees. The model encompasses many important randomized algorithms and data structures.
Holmgren, Cecilia, +3 more
core +2 more sources

