Results 81 to 90 of about 723,488 (236)
Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees
, 2016 This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time.
Holmgren, Cecilia, Janson, Svante
core +1 more source
Spanning Trees in Random Satisfiability Problems
, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour +6 more
core +1 more source
Disassortativity of random critical branching trees
, 2009 Random critical branching trees (CBTs) are generated by the multiplicative branching process, where the branching number is determined stochastically, independent of the degree of their ancestor.
Kahng, B., Kim, D., Kim, J. S.
core +1 more source
Deterministic Random Walks on Regular Trees
, 2010 Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput.
Cooper, Joshua +3 more
core +3 more sources
On the speed of once-reinforced biased random walk on trees
, 2018 We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root.
Collevecchio, Andrea +2 more
core +1 more source
International Journal of Prognostics and Health Management, 2013 This study presents the methods employed by a team from the department of Mechatronics and Dynamics at the University of Paderborn, Germany for the 2013 PHM data challenge.
James K. Kimotho +3 more
doaj +1 more source
Random enriched trees with applications to random graphs
, 2016 We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random unlabelled $k$-
Stufler, Benedikt
core +1 more source
Random trees with superexponential branching weights
, 2011 We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$.
Durhuus B +5 more
core +1 more source
On the tree-depth of random graphs
Discrete Applied Mathematics, 2014 The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s. td(G)=n-O(sqrt(n/p)). Random graphs with p=c/n, have a.a.s.
Perarnau Llobet, Guillem +1 more
openaire +3 more sources
A survey of path planning of industrial robots based on rapidly exploring random trees. [PDF]
Front Neurorobot, 2023 Luo S, Zhang M, Zhuang Y, Ma C, Li Q.
europepmc +1 more source