Results 41 to 50 of about 2,453,886 (301)
, 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
Fractal Dimensions of Random Trees [PDF]
The Egyptian Statistical Journal, 1994 Our goal in this paper is to determine whether the fractal dimensions (FD) of random trees is finite. Two types of random trees are considered. We first consider spherically symmetric random trees in which all vertices at level n have degree 3 with ...
Mokhtar Konsowa
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
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
Scaling limit for the random walk on the largest connected component of the critical random graph [PDF]
, 2012 In this article, a scaling limit for the simple random walk on the largest connected component of the Erdos-Rényi random graph G(n,p) in the critical window, p = n−1+λn−4/3, is deduced.
Croydon, David A.
core +1 more source
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
, 2022 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 +1 more source
Hausdorff measure of arcs and Brownian motion on Brownian spatial trees [PDF]
, 2009 A Brownian spatial tree is defined to be a pair $(\mathcal{T},\phi)$, where $\mathcal{T}$ is the rooted real tree naturally associated with a Brownian excursion and φ is a random continuous function from $\mathcal{T}$ into ℝd such that, conditional on ...
Croydon, David A.
core +1 more source
Tree limits and limits of random trees [PDF]
Combinatorics, Probability and Computing, 2021 AbstractWe 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 and generalized split trees (as defined here), and for trees defined by a continuous-time ...
openaire +3 more sources
Bindweeds or random walks in random environments on multiplexed trees and their asympotics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree.The term multiplexed means that the model can be viewed as a nearest neighbours random walk ...
Mikhail Menshikov +2 more
doaj +1 more source
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source