Results 61 to 70 of about 5,525,400 (353)
Bindweeds or random walks in random environments on multiplexed trees and their asympotics [PDF]
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
General Edgeworth expansions with applications to profiles of random trees [PDF]
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]
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
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the probability of a given tree is proportional to $\prod_{v_i\in V(T)}d(v_i)!$.
openaire +4 more sources
Systematic Literature Review of Sampling Process in Rapidly-Exploring Random Trees
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
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree.
openaire +3 more sources
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 +3 more sources
Extremely randomized trees [PDF]
This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute and cut-point choice while splitting a tree node. In the extreme case, it builds totally randomized trees whose structures are independent of the output values of the learning sample.
Geurts, Pierre+2 more
openaire +3 more sources
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
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]
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