Results 271 to 280 of about 2,454,962 (300)

Random trees in a graph and trees in a random graph

Mathematical Proceedings of the Cambridge Philosophical Society, 1986
This paper treats two related sets of problems in the theory of random graphs. In Sections 2 and 3 we study random spanning subtrees of a complete graph (or, equivalently, random labelled trees). It is shown that the number of common edges of two such random trees asymptotically has a Poisson distribution with expectation 2.
openaire   +1 more source

An Introduction to Random Trees

Research on Language and Computation, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Random Censoring and Dendritic Trees

Biometrics, 1977
The motivating problem is the estimation of the branching parameters of dendritic trees when some of the branches are cut. A primary element of this problem is the estimation of a bivariate discrete distribution when, because of partial censoring, some of the observations are incomplete.
G P, McCabe, M L, Samuels
openaire   +2 more sources

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   +3 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

On random 2?3 trees

Acta Informatica, 1978
It is shown that ¯n (N), the average number of nodes in an N-key random 2---3 tree, satisfies the inequality 0.70 N < ¯n(N)
openaire   +2 more sources

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees

Discrete Applied Mathematics, 2021
Cecilia Holmgren, Ralph Neininger
exaly