Results 31 to 40 of about 166,958 (306)
Limit theorems for sequences of random trees [PDF]
, 2009 We consider a random tree and introduce a metric in the space of trees to define the ""mean tree"" as the tree minimizing the average distance to the random tree.
Balding, D +7 more
core +1 more source
Trees with product-form random weights [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We consider growing random recursive trees in random environment, in which at each step a new vertex is attached according to a probability distribution that assigns the tree vertices masses proportional to their random weights.The main aim of the paper ...
Konstantin Borovkov, Vladimir Vatutin
doaj +1 more source
, 1991 In this paper we give a survey of the symbolic operator methods to do statistics on random trees.
Díaz Cort, Josep +2 more
core +2 more sources
, 2022 We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with n vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of their labels. With each new vertex, all edges to previously uncovered vertices are uncovered as well.
Benjamin Hackl +2 more
openaire +4 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
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
Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees [PDF]
Mathematics Interdisciplinary Research, 2021 For a simple graph G, the Gordon-Scantlebury index of G is equal to the number of paths of length two in G, and the Platt index is equal to the total sum of the degrees of all edges in G.
Ramin Kazemi
doaj +1 more source
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
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
Ergodic Theory and Dynamical Systems, 2013 AbstractWe consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek.
Benjamini, Itai +2 more
openaire +3 more sources