Results 281 to 290 of about 246,128 (313)
Some of the next articles are maybe not open access.
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
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
30th Annual Symposium on Foundations of Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
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
RANDOM WALKS AND DIMENSIONS OF RANDOM TREES
Infinite Dimensional Analysis, Quantum Probability and Related Topics, 2010We 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
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
Studia Scientiarum Mathematicarum Hungarica, 2002
In a one-parameter model for evolution of random trees strong law of large numbers and central limit theorem are proved for the number of vertices with low degree. The proof is based on elementary martingale theory.
openaire +2 more sources
In a one-parameter model for evolution of random trees strong law of large numbers and central limit theorem are proved for the number of vertices with low degree. The proof is based on elementary martingale theory.
openaire +2 more sources
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
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
1992
In this lecture we will describe a very simple probabilistic data structure that allows inserts, deletes, and membership tests (among other operations) in expected logarithmic time.
openaire +1 more source
In this lecture we will describe a very simple probabilistic data structure that allows inserts, deletes, and membership tests (among other operations) in expected logarithmic time.
openaire +1 more source
Noble-Metal Based Random Alloy and Intermetallic Nanocrystals: Syntheses and Applications
Chemical Reviews, 2021Ming Zhou, Can Li, Jiye Fang
exaly