Results 11 to 20 of about 5,474,085 (350)
Universal height and width bounds for random trees [PDF]
Electronic Journal of Probability, 2021 We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models.
L. Addario-Berry +3 more
semanticscholar +1 more source
Stochastic rumors on random trees [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2021 The Maki–Thompson rumor model is defined by assuming that a population represented by a graph is subdivided into three classes of individuals; namely, ignorants, spreaders and stiflers.
V. V. Junior +2 more
semanticscholar +1 more source
On random trees and forests [PDF]
ESAIM: Proceedings and Surveys, 2023 The first talk at the session Random trees and random forests “Journée MAS” (27/08/2021) was presented by I. Kortchemski. After a general up-to-date introduction to local and scaling limits of Bienaymé trees (which are discrete branching trees), he ...
Contat Alice +4 more
doaj +1 more source
Profiles of random trees: plane-oriented recursive trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximations of the expected width and the ...
Hsien-Kuei Hwang
doaj +1 more source
Additive tree functionals with small toll functions and subtrees of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Many parameters of trees are additive in the sense that they can be computed recursively from the sum of the branches plus a certain toll function. For instance, such parameters occur very frequently in the analysis of divide-and-conquer algorithms. Here
Stephan Wagner
doaj +1 more source
Sharpness of the phase transition for parking on random trees [PDF]
Random Struct. Algorithms, 2020 Recently, a phase transition phenomenon has been established for parking on random trees. We extend the results of Curien and Hénard on general Bienaymé–Galton–Watson trees and allow different car arrival distributions depending on the vertex outdegrees.
Alice Contat
semanticscholar +1 more source
Parking on a Random Tree [PDF]
Journal of Statistical Physics, 2008 Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one.
Herold Dehling +2 more
openaire +4 more sources
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
Random Trees Are the Cornerstones of Natural Forests
Forests, 2021 Natural forests serve as the main component of the forest ecosystem. An in-depth interpretation of tree composition and structure of forest community is of great significance for natural forest conservation, monitoring, management, and near-natural ...
Gongqiao Zhang, G. Hui
semanticscholar +1 more source
A functional limit law for the profile of plane-oriented recursive trees. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a functional limit law for the normalized profile of random plane-oriented recursive trees. The proof uses martingale convergence theorems in discrete and continuous-time. This complements results of Hwang (2007).
Henning Sulzbach
doaj +1 more source