Results 71 to 80 of about 723,488 (236)
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj +1 more source
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
Degree distribution of random Apollonian network structures and Boltzmann sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Random Apollonian networks have been recently introduced for representing real graphs. In this paper we study a modified version: random Apollonian network structures (RANS), which preserve the interesting properties of real graphs and can be handled ...
Alexis Darrasse, Michèle Soria
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1971 AbstractThe problem is considered of determining the distribution of the number of nodes in any given component of a forest obtained by removing edges from a random tree.
openaire +3 more sources
, 2018 We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic assumptions ...
Rousselin, Pierre
core +2 more sources
Classification of Alpine Skiing Styles Using GNSS and Inertial Measurement Units
Sensors, 2020 In alpine skiing, four commonly used turning styles are snowplow, snowplow-steering, drifting and carving. They differ significantly in speed, directional control and difficulty to execute.
Christina Neuwirth +5 more
doaj +1 more source
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
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source
Width and mode of the profile for some random trees of logarithmic height
, 2006 We propose a new, direct, correlation-free approach based on central moments of profiles to the asymptotics of width (size of the most abundant level) in some random trees of logarithmic height.
Devroye, Luc, Hwang, Hsien-Kuei
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