We consider growing random recursive trees in random environment, in which at each step a new vertex is attached according to a probability distribution that assigns the tree vertices masses proportional to their random weights.The main aim of the paper is to study the asymptotic behavior of the mean numbers of outgoing vertices as the number of steps tends to infinity, under the assumption that the random weights have a product form with independent identically distributed factors
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of ite...
We consider growing random recursive trees in random environment, in which at each step a new vertex...
40 pagesWeighted recursive trees are built by adding successively vertices with predetermined weight...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
We study two models of growing recursive trees. For both models, initially the tree only contains on...
In this work we study edge weights for two specific families of increasing trees, which include bina...
We establish limit theorems that describe the asymptotic local and global geometric behaviour of ran...
AbstractWe introduce random recursive trees, where deterministically weights are attached to the edg...
We study depth properties of a general class of random recursive trees where each node n attaches to...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our inv...
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of ite...
We consider growing random recursive trees in random environment, in which at each step a new vertex...
40 pagesWeighted recursive trees are built by adding successively vertices with predetermined weight...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
We study two models of growing recursive trees. For both models, initially the tree only contains on...
In this work we study edge weights for two specific families of increasing trees, which include bina...
We establish limit theorems that describe the asymptotic local and global geometric behaviour of ran...
AbstractWe introduce random recursive trees, where deterministically weights are attached to the edg...
We study depth properties of a general class of random recursive trees where each node n attaches to...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our inv...
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of ite...