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
We introduce a general recursive method to construct continuum random trees (CRTs) from independent ...
We establish limit theorems that describe the asymptotic local and global geometric behaviour of ran...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
We consider growing random recursive trees in random environment, in which at each step a new vertex...
We consider growing random recursive trees in random environment, in which at each step a new vertex...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
40 pagesWeighted recursive trees are built by adding successively vertices with predetermined weight...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
AbstractWe introduce random recursive trees, where deterministically weights are attached to the edg...
In this work we study edge weights for two specific families of increasing trees, which include bina...
We study two models of growing recursive trees. For both models, initially the tree only contains on...
We study depth properties of a general class of random recursive trees where each node n attaches to...
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights a...
AbstractIf a recursive tree is selected uniformly at random from among all recursive trees on n vert...
We introduce a general recursive method to construct continuum random trees (CRTs) from independent ...
We establish limit theorems that describe the asymptotic local and global geometric behaviour of ran...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
We consider growing random recursive trees in random environment, in which at each step a new vertex...
We consider growing random recursive trees in random environment, in which at each step a new vertex...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
40 pagesWeighted recursive trees are built by adding successively vertices with predetermined weight...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
AbstractWe introduce random recursive trees, where deterministically weights are attached to the edg...
In this work we study edge weights for two specific families of increasing trees, which include bina...
We study two models of growing recursive trees. For both models, initially the tree only contains on...
We study depth properties of a general class of random recursive trees where each node n attaches to...
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights a...
AbstractIf a recursive tree is selected uniformly at random from among all recursive trees on n vert...
We introduce a general recursive method to construct continuum random trees (CRTs) from independent ...
We establish limit theorems that describe the asymptotic local and global geometric behaviour of ran...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...