Results 31 to 40 of about 736,356 (194)
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
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
Random Walks in I.I.D. Random Environment on Cayley Trees [PDF]
, 2014 We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the i.i.d ...
Athreya, Siva +2 more
core +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
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
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
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
Intersection of random spanning trees in complex networks
Applied Network Science, 2023 In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Springer, Cham, 2023)
András London, András Pluhár
doaj +1 more source
Multicritical continuous random trees
, 2006 We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root singularity in their ...
+15 more
core +3 more sources
International Journal of Mathematics and Mathematical Sciences, 2005 The number of local maxima (resp., local minima) in a tree T∈𝒯n rooted at r∈[n] is denoted by Mr(T) (resp., by mr(T)). We find exact formulas as rational functions of n for the expectation and variance of M1(T) and mn(T) when T∈𝒯n is chosen randomly ...
Lane Clark
doaj +1 more source