Results 21 to 30 of about 736,356 (194)
, 2014 Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs.
Deák, Attila
core +4 more sources
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
Fragmentation of Random Trees [PDF]
, 2014 We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node.
Ben-Naim, E., Kalay, Z.
core +2 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
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
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
Partial match queries in relaxed K-dt trees [PDF]
, 2017 The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval.
Duch Brown, Amalia +1 more
core +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