Results 261 to 270 of about 2,906,539 (296)
Some of the next articles are maybe not open access.
On the Contour of Random Trees
SIAM Journal on Discrete Mathematics, 1999Two stochastic processes describing the contour of simply generated random trees are studied: the contour process as defined by Gutjahr and Pflug [W. Gutjahr and G. Ch. Pflug, Stochastic Process. Appl., 41 (1992), pp. 69--89] and the traverse process constructed of the node heights during pre-order traversal of the tree.
openaire +2 more sources
Random trees and random graphs
Random Structures and Algorithms, 1998Summary: We study the asymptotic behavior of the number of trees with \(n\) vertices and diameter \(k= k(n)\), where \((n- k)/n\to a\) as \(n\to\infty\) for some constant \(a< 1\). We use this result to determine the limit distribution of the diameter of the random graph \(G(n,p)\) in the subcritical phase.
openaire +3 more sources
The properties of random trees
Information Sciences, 1989The author gives various statistical results on properties of random trees that occur as data structures. There are several interesting results, but the title of the paper seems to be to general to the reviewer.
openaire +2 more sources
Statistics & Probability Letters, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konsowa, Mokhtar H., Oraby, Tamer F.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konsowa, Mokhtar H., Oraby, Tamer F.
openaire +2 more sources
Theory of Probability & Its Applications, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
An Introduction to Random Trees
Research on Language and Computation, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random trees in a graph and trees in a random graph
Mathematical Proceedings of the Cambridge Philosophical Society, 1986This 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
Probability in the Engineering and Informational Sciences, 2002
We prove that the effective resistances of spherically symmetric random trees dominate in mean the effective resistances of random trees corresponding branching processes in varying environments and having the same growth law of spherically symmetric trees.
openaire +2 more sources
We prove that the effective resistances of spherically symmetric random trees dominate in mean the effective resistances of random trees corresponding branching processes in varying environments and having the same growth law of spherically symmetric trees.
openaire +2 more sources
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
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
1989The 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

