Results 41 to 50 of about 744,531 (188)
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
Faster generation of random spanning trees [PDF]
, 2009 In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected time $\TO(m\sqrt ...
Kelner, Jonathan A., Madry, Aleksander
core +4 more sources
Embedding spanning trees in random graphs [PDF]
, 2010 We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*max{D*logn,n^{\epsilon}} for some constant \epsilon>0, then with high probability the random graph G(n,p) contains a copy of T.
Krivelevich, Michael
core +1 more source
Mathematics of Operations Research, 1984 A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
openaire +2 more sources
Large Deviations for Random Trees [PDF]
Journal of Statistical Physics, 2008 10 ...
Bakhtin, Yuri, Heitsch, Christine
openaire +4 more sources
Applied SciencesThe degradation of pastures and meadows is a global problem with a wide range of impacts. It affects farmers in different ways, such as decreases in cattle production, milk yield, and forage quality. Still, it also has other side effects, such as loss of
Boris Evstatiev +12 more
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
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
Unsupervised Extremely Randomized Trees [PDF]
, 2018 In this paper we present a method to compute dissimilarities on unlabeled data, based on extremely randomized trees. This method, Unsupervised Extremely Randomized Trees, is used jointly with a novel randomized labeling scheme we describe here, and that we call AddCl3.
Dalleau, Kevin +2 more
openaire +2 more sources