Results 31 to 40 of about 744,531 (188)
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
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
Spanning trees in random graphs [PDF]
, 2019 For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$.
Montgomery, Richard
core +2 more sources
Random Hyperplane Search Trees
SIAM Journal on Computing, 2009 Summary: A hyperplane search tree is a binary tree used to store a set \(S\) of \(n\) \(d\)-dimensional data points. In a random hyperplane search tree for \(S\), the root represents a hyperplane defined by \(d\) data points drawn uniformly at random from \(S\).
Devroye, L, King, J, McDiarmid, C
openaire +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
A simple and effective approach to quantitatively characterize structural complexity
Scientific Reports, 2021 This study brings insight into interpreting forest structural diversity and explore the classification of individuals according to the distribution of the neighbours in natural forests. Natural forest communities with different latitudes and distribution
Gongqiao Zhang +3 more
doaj +1 more source
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
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
Asymptotic variance of random symmetric digital search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Dedicated to the 60th birthday of Philippe ...
Hsien-Kuei Hwang +2 more
doaj +1 more source