Results 61 to 70 of about 5,474,085 (350)

Limit laws for two distance-based indices in random recursive tree models

open access: yesActa Universitatis Sapientiae: Informatica, 2022
In this paper, we derive several results related to total path length and Sackin index in two classes of random recursive trees. A limiting distribution of the normalized version of the Sackin index is given by the contraction method in random recursive ...
Naderi Sarkoat   +2 more
doaj   +1 more source

General Edgeworth expansions with applications to profiles of random trees [PDF]

open access: yes, 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

Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]

open access: yesDiscrete 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 and applications [PDF]

open access: yesProbability Surveys, 2005
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the convergence in distribution of the contour process of conditioned Galton-Watson trees towards the normalized Brownian
openaire   +5 more sources

Local extrema in random trees

open access: yesInternational 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

Asymptotic variance of random symmetric digital search trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
Dedicated to the 60th birthday of Philippe ...
Hsien-Kuei Hwang   +2 more
doaj   +1 more source

Balance in Random Trees

open access: yesOpen Journal of Discrete Mathematics, 2014
We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly $k$-balanced for any $k\geq 3$.
Warren E. Shreve, Azer Akhmedov
openaire   +4 more sources

Random walks on complex trees [PDF]

open access: yesPhysical 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

Systematic Literature Review of Sampling Process in Rapidly-Exploring Random Trees

open access: yesIEEE 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]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy