AbstractWe investigate the profile of random Pólya trees of size n when only nodes of degree d are counted in each level. It is shown that, as in the case where all nodes contribute to the profile, the suitably normalized profile process converges weakly to a Brownian excursion local time. Moreover, we investigate the joint distribution of the number of nodes of degrees d1 and d2 on the same level of the tree
Abstract. We study the distance-profile of the random rooted plane graph Gn with n edges (by a plane...
AbstractThe contour process of a random binary tree t with n internal nodes is defined as the polygo...
In this article, we explicitly derive the limiting degree distribution of the shortest path tree fro...
AbstractWe investigate the profile of random Pólya trees of size n when only nodes of degree d are c...
We consider the number of nodes in the levels of unlabeled rooted random trees and show that the joi...
AbstractWe consider the number of nodes in the levels of unlabelled rooted random trees and show tha...
Abstract. We consider the number of nodes in the levels of unlabeled rooted random trees and show th...
It is well known that the height profile of a critical conditioned Galton-Watson tree with finite of...
Abstract. Let T be a plane rooted tree with n nodes which is regarded as family tree of a Galton-Wat...
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was ...
We summarize several limit results for the profile of random plane-oriented recursive trees. These i...
AbstractFor labeled trees, Rényi showed that the probability that an arbitrary point of a random tre...
For labeled trees, Renyi showed that the probability that an arbitrary point of a random tree has de...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
International audienceLet $t$ be a rooted tree and $n_i(t)$ the number of nodes in $t$ having $i$ ch...
Abstract. We study the distance-profile of the random rooted plane graph Gn with n edges (by a plane...
AbstractThe contour process of a random binary tree t with n internal nodes is defined as the polygo...
In this article, we explicitly derive the limiting degree distribution of the shortest path tree fro...
AbstractWe investigate the profile of random Pólya trees of size n when only nodes of degree d are c...
We consider the number of nodes in the levels of unlabeled rooted random trees and show that the joi...
AbstractWe consider the number of nodes in the levels of unlabelled rooted random trees and show tha...
Abstract. We consider the number of nodes in the levels of unlabeled rooted random trees and show th...
It is well known that the height profile of a critical conditioned Galton-Watson tree with finite of...
Abstract. Let T be a plane rooted tree with n nodes which is regarded as family tree of a Galton-Wat...
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was ...
We summarize several limit results for the profile of random plane-oriented recursive trees. These i...
AbstractFor labeled trees, Rényi showed that the probability that an arbitrary point of a random tre...
For labeled trees, Renyi showed that the probability that an arbitrary point of a random tree has de...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
International audienceLet $t$ be a rooted tree and $n_i(t)$ the number of nodes in $t$ having $i$ ch...
Abstract. We study the distance-profile of the random rooted plane graph Gn with n edges (by a plane...
AbstractThe contour process of a random binary tree t with n internal nodes is defined as the polygo...
In this article, we explicitly derive the limiting degree distribution of the shortest path tree fro...
DOI
Add to ORKG