Results 271 to 280 of about 166,958 (306)
Some of the next articles are maybe not open access.
On the profile of random trees
Random Structures and Algorithms, 1997Summary: Let \(T\) be a plane rooted tree with \(n\) nodes which is regarded as family tree of a Galton-Watson branching process conditioned on the total progeny. The profile of the tree may be described by the number of nodes or the number of leaves in layer \(t\sqrt n\), respectively.
Michael Drmota, Bernhard Gittenberger
openaire +2 more sources
Random Structures & Algorithms, 1994
AbstractCartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. If the search key and the priority key are independent, and the trees is built based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees.
openaire +1 more source
AbstractCartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. If the search key and the priority key are independent, and the trees is built based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees.
openaire +1 more source
On the Contour of Random Trees
SIAM Journal on Discrete Mathematics, 1999The author considers two sequences defined for trees from a simply generated family of rooted trees: the sequence of heights of the terminal nodes of the tree, proceeding from left to right; and the sequence of heights of the nodes encountered in a 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 +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
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 +1 more source
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
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