Results 51 to 60 of about 6,285,799 (375)
On the number of transversals in random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our investigation treats the average number of transversals of fixed size, the size of a random transversal as well as the probability that a random subset of ...
Bernhard Gittenberger, Veronika Kraus
doaj +1 more source
Recursive construction of continuum random trees [PDF]
Annals of Probability, 2016 We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related structures.
Franz Rembart, Matthias Winkel
semanticscholar +1 more source
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
Combinatorics, Probability and Computing, 2018 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. In particular, this applies to the random recursive tree and the standard preferential attachment tree.
openaire +3 more sources
Spanning trees in random graphs [PDF]
, 2019 For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$.
Montgomery, Richard
core +2 more sources
A simple and effective approach to quantitatively characterize structural complexity
Scientific Reports, 2021 This study brings insight into interpreting forest structural diversity and explore the classification of individuals according to the distribution of the neighbours in natural forests. Natural forest communities with different latitudes and distribution
Gongqiao Zhang +3 more
doaj +1 more source
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source
Spectral atoms of unimodular random trees [PDF]
Journal of the European Mathematical Society (Print), 2016 We use the Mass Transport Principle to analyze the local recursion governing the resolvent $(A-z)^{-1}$ of the adjacency operator of unimodular random trees.
Justin Salez
semanticscholar +1 more source
Asymptotic variance of random symmetric digital search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Dedicated to the 60th birthday of Philippe ...
Hsien-Kuei Hwang +2 more
doaj +1 more source
The scaling of the minimum sum of edge lengths in uniformly random trees [PDF]
arXiv.org, 2016 The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly.
J. L. Esteban +2 more
semanticscholar +1 more source
Multilayer parking with screening on a random tree [PDF]
, 2009 In this paper we present a multilayer particle deposition model on a random tree. We derive the time dependent densities of the first and second layer analytically and show that in all trees the limiting density of the first layer exceeds the density in ...
A. Sudbury +7 more
core +1 more source