Results 281 to 290 of about 258,206 (308)

Random spanning tree

Journal of Algorithms, 1983
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire   +1 more source

Random leaders and random spanning trees

1989
The problem of distributively constructing a minimum spanning tree has been thoroughly studied. The root of this spanning tree is often elected as a leader, and then centralized algorithms are run in the distributed system. If, however, we have fault tolerance in mind, selecting a random spanning tree and a random leader are more desirable.
Judit Bar-Ilan, Dror Zernik
openaire   +1 more source

Random Sequential Adsorption on Random Trees

Journal of Statistical Physics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

RANDOM WALKS AND DIMENSIONS OF RANDOM TREES

Infinite Dimensional Analysis, Quantum Probability and Related Topics, 2010
We study the relationship between the type of the random walk on some random trees and the structure of those trees in terms of fractal and resistance dimensions. This paper generalizes some results of Refs. 8–10.
openaire   +1 more source

The Height and Size of Random Hash Trees and Random Pebbled Hash Trees

SIAM Journal on Computing, 1999
Summary: The random hash tree and the \(N\)-tree were introduced by Ehrlich in 1981. In the random hash tree, \(n\) data points are hashed to values \(X_1, \dots, X_n\), independently and identically distributed random variables taking values that are uniformly distributed on \([0,1]\).
openaire   +2 more sources

Random walks on trees

2005
Random walks or Brownian motions appear as a useful tool in algorithm analysis. Recently P. Flajolet ([2]) obtained a complete and detailed analysis of the two stacks problem with the help of properties of simple random walks on lattices. G. Louchard ([7], [8]) proved that the Brownian motion permits to give easily asymptotic results on the complexity ...
openaire   +1 more source

Random Trees and Tree Codes

1972
A random tree is a probabilistic system much like a random walk. In a random walk, a particle moves up or down as time progresses in accordance with some stochastic law. A random tree, on the other hand, starts with one particle at time zero, this particle branches into a number of particles, each of which move up or down in accordance with a ...
openaire   +1 more source

Modeling flood susceptibility using data-driven approaches of naïve Bayes tree, alternating decision tree, and random forest methods

Science of the Total Environment, 2020
Wei Chen, Himan Shahabi, Shaojun Li
exaly  

The Continuum Random Tree. I

Annals of Probability, 1991
David J Aldous
exaly  

On the Multifractal Analysis of Branching Random Walk on Galton–Watson Tree with Random Metric

Journal of Theoretical Probability, 2020
Najmeddine Attia, Attia Najmeddine
exaly