Results 61 to 70 of about 736,356 (194)
, 2010 We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from the target node
Ben-Naim, E., Krapivsky, P. L.
core +1 more source
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
Parallel Quantum Rapidly-Exploring Random Trees
IEEE AccessIn this paper, we present the Parallel Quantum Rapidly-Exploring Random Tree (Pq-RRT) algorithm, a parallel version of the Quantum Rapidly-Exploring Random Trees (q-RRT) algorithm.
Paul Lathrop +2 more
doaj +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
Large deviations of empirical neighborhood distribution in sparse random graphs
, 2014 Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring distribution with ...
Bordenave, Charles, Caputo, Pietro
core +1 more source
Full Degree Spanning Trees in Random Regular Graphs [PDF]
, 2022 Sarah Acquaviva, Deepak Bal
openalex +1 more source
Spatial Downscaling of GPM Satellite Precipitation Data Using Extreme Random Trees [PDF]
, 2023 Shaonan Zhu +4 more
openalex +1 more source
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