1 citations · 1 across the 7 of their papers we have counts for
8 papers
Fringe subtrees of split trees and fractional split trees
Cecilia Holmgren, Jasper Ischebeck, Svante Janson
We consider additive functionals with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector…
A tightness criterion for fragmentations
Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
This note presents a simple criterion for the tightness of stochastic fragmentation processes. Our work is motivated by an application to a fragmentation process derived from delet…
The number of descendants in a preferential attachment graph
Svante Janson, Tiffany Y. Y. Lo
We study the number of vertices that can be reached from the last added vertex via a directed path (the descendants) in the standard preferential attachment graph. In…
Uncovering a graph
Svante Janson
Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the numbe…
Fringe trees for random trees with given vertex degrees
Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove cor…
Approximation of Subgraph Counts in the Uniform Attachment Model
Johan Björklund, Cecilia Holmgren, Svante Janson +1
We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rate…
Conditioned Galton-Watson trees do not grow
Svante Janson
An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, as has been shown in a special case by Luczak an…
The density of the ISE and local limit laws for embedded trees
Mireille Bousquet-Mélou, Svante Janson
It has been known for a few years that the occupation measure of several models of embedded trees converges, after a suitable normalization, to the random measure called ISE (Integ…