Results 51 to 60 of about 5,579,561 (370)
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
Tail Bounds for the Wiener Index of Random Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees are given. For upper bounds the moment generating function of the vector of Wiener index and internal path length is estimated.
Tämur Ali Khan, Ralph Neininger
doaj +1 more source
Acta Mathematica Hungarica, 2013 Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the probability of a given tree is proportional to $\prod_{v_i\in V(T)}d(v_i)!$.
openaire +4 more sources
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
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
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
Election algorithms with random delays in trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied.
Jean-François Marckert +2 more
doaj +1 more source
On the Zagreb index of random m-oriented recursive trees [PDF]
Transactions on Combinatorics, 2023 The main goal of this paper is to study the modified $F$-indices (modified first Zagreb index and modified forgotten topological index) of random $m$-oriented recursive trees (RMORTs).
Ramin Kazemi
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
Extremely randomized trees [PDF]
Machine Learning, 2006 This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute and cut-point choice while splitting a tree node. In the extreme case, it builds totally randomized trees whose structures are independent of the output values of the learning sample.
Geurts, Pierre +2 more
openaire +4 more sources