Add to ORKGRandom forests are studied. A moment inequality and a strong law of large numbers are obtained for the number of trees having a fixed number of nonroot vertices. © Akadémiai Kiadó, Budapest, Hungary, 2009
For labeled trees, Renyi showed that the probability that an arbitrary point of a random tree has de...
In these expository paper we describe the role of the rooted trees as a base for convenient tools in...
AbstractBy constructing a non-negative martingale on a homogeneous tree, a class of small deviation ...
Random forests are studied. A moment inequality and a strong law of large numbers are obtained for t...
Under the unifying umbrella of a general result of Penrose & Yukich [Ann. Appl. Probab., (2003) 13, ...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
AbstractWe consider random tries and random PATRICIA trees constructed from n independent strings of...
We consider random tries and random patricia trees constructed from n independent strings of symbols...
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' a...
A ballot theorem is a theorem that yields information about the conditional probability that a rando...
AbstractThe analytic methods of Pólya, as reported in [1, 6] are used to determine the asymptotic be...
This thesis presents an up-to-date survey of results concerning laws of large numbers for sequences ...
The aim is to develop the methods for investigation of the random forestes, to obtain the total desc...
We study the strong law of large numbers for the frequencies of occurrence of states and ordered cou...
A linear forest is a forest in which each connected component is a path. The linear arboricity la(G)...
For labeled trees, Renyi showed that the probability that an arbitrary point of a random tree has de...
In these expository paper we describe the role of the rooted trees as a base for convenient tools in...
AbstractBy constructing a non-negative martingale on a homogeneous tree, a class of small deviation ...
Random forests are studied. A moment inequality and a strong law of large numbers are obtained for t...
Under the unifying umbrella of a general result of Penrose & Yukich [Ann. Appl. Probab., (2003) 13, ...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
AbstractWe consider random tries and random PATRICIA trees constructed from n independent strings of...
We consider random tries and random patricia trees constructed from n independent strings of symbols...
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' a...
A ballot theorem is a theorem that yields information about the conditional probability that a rando...
AbstractThe analytic methods of Pólya, as reported in [1, 6] are used to determine the asymptotic be...
This thesis presents an up-to-date survey of results concerning laws of large numbers for sequences ...
The aim is to develop the methods for investigation of the random forestes, to obtain the total desc...
We study the strong law of large numbers for the frequencies of occurrence of states and ordered cou...
A linear forest is a forest in which each connected component is a path. The linear arboricity la(G)...
For labeled trees, Renyi showed that the probability that an arbitrary point of a random tree has de...
In these expository paper we describe the role of the rooted trees as a base for convenient tools in...
AbstractBy constructing a non-negative martingale on a homogeneous tree, a class of small deviation ...