Results 71 to 80 of about 744,531 (188)
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
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
Random walks on random trees [PDF]
Journal of the Australian Mathematical Society, 1973 Let T denote one of the nn−2 trees with n labelled nodes that is rooted at a given node x (see [6] or [8] as a general reference on trees). If i and j are any two nodes of T, we write i ∼ j if they are joined by an edge in T. We want to consider random walks on T; we assume that when we are at a node i of degree d the probability that we proceed to ...
openaire +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
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
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
Spanning tree size in random binary search trees
The Annals of Applied Probability, 2004 This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal distribution.
Panholzer, Alois, Prodinger, Helmut
openaire +3 more sources
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
Risk bounds for purely uniformly random forests [PDF]
, 2010 Random forests, introduced by Leo Breiman in 2001, are a very effective statistical method. The complex mechanism of the method makes theoretical analysis difficult.
Genuer, Robin
core +3 more sources
Minimum spanning trees on random networks
, 2001 We show that the geometry of minimum spanning trees (MST) on random graphs is universal. Due to this geometric universality, we are able to characterise the energy of MST using a scaling distribution ($P(\epsilon)$) found using uniform disorder.
A. A. Middleton +24 more
core +1 more source