Random walks on complex trees [PDF]
Physical Review E, 2008 We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the
Baronchelli, Andrea +2 more
openaire +6 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
Distinct Fringe Subtrees in Random Trees [PDF]
arXiv, 2021 A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in two types of random trees: simply generated trees and families of increasing trees (recursive trees, $d$-ary increasing trees and generalized plane-oriented recursive ...
arxiv
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
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
Random environment on coloured trees [PDF]
Bernoulli, 2007 In this paper, we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints. We obtain some new results relevant to this model and also show how our model generalizes many other probabilistic models, including random walk in random ...
Menshikov, Mikhail +2 more
openaire +9 more sources
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
A functional central limit theorem for branching random walks, almost sure weak convergence, and applications to random trees [PDF]
, 2014 Let $W_{\infty}(\beta)$ be the limit of the Biggins martingale $W_n(\beta)$ associated to a supercritical branching random walk with mean number of offspring $m$. We prove a functional central limit theorem stating that as $n\to\infty$ the process $$ D_n(
Rudolf Grubel, Z. Kabluchko
semanticscholar +1 more source
Random trees constructed by aggregation [PDF]
, 2014 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.
N. Curien, Bénédicte Haas
semanticscholar +1 more source
Spatial patterns and intra-specific competition of Chestnut-leaved oak (Quercus castaneifolia C. A. Mey.) using O- ring statistic (Case study: Neka Forest, Iran) [PDF]
تحقیقات جنگل و صنوبر ایران, 2015 The spatial patterns of trees in different stages of their life provide important information related to forest regeneration and succession processes.
Farideh Omidvar Hosseini +3 more
doaj +1 more source