Results 31 to 40 of about 723,488 (236)
Concentration Properties of Extremal Parameters in Random Discrete Structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The purpose of this survey is to present recent results concerning concentration properties of extremal parameters of random discrete structures. A main emphasis is placed on the height and maximum degree of several kinds of random trees. We also provide
Michael Drmota
doaj +1 more source
30th Annual Symposium on Foundations of Computer Science, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cecilia Aragon +2 more
openaire +2 more sources
Discrete Applied Mathematics, 2019 Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support we show that $1.41805386^n \le c(n) \le 1.41959881^n$. Moreover, there is a strong indication that, in fact, $c(n) \
Bogumił Kamiński, Paweł Prałat
openaire +3 more sources
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
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
Random trees constructed by aggregation [PDF]
, 2016 We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree.
Curien, Nicolas, Haas, Bénédicte
core +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
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
ESAIM: Proceedings, 2011 These notes provide an elementary and self-contained introduction to branching ran- dom walks. Section 1 gives a brief overview of Galton-Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly in- dispensable, but they introduce the idea of using size-biased trees,
openaire +2 more sources
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 +5 more sources