Results 61 to 70 of about 6,285,799 (375)
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
Systematic Literature Review of Sampling Process in Rapidly-Exploring Random Trees
IEEE Access, 2019 Path planning is one of the most important process on applications such as navigating autonomous vehicles, computer graphics, game development, robotics, and protein folding.
L. G. D. O. Véras +2 more
semanticscholar +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
General Edgeworth expansions with applications to profiles of random trees [PDF]
, 2016 We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity.
Z. Kabluchko +2 more
semanticscholar +1 more source
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs [PDF]
Probability theory and related fields, 2015 One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade (Braunstein et al. in Phys Rev Lett 91(16):168701, 2003; Wu et al.
S. Bhamidi, R. Hofstad, S. Sen
semanticscholar +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
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
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
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