Showing 2023Show all
3 papers · 1 filter
math.PR2023
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…
math.PR2023
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…
math.PR2023
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…