1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2026
Graphon Colourings and Limits of Graph Partitions
Svante Janson, Tiffany Y. Y. Lo, Colin McDiarmid +2
We develop a framework for pure and mixed graphon colourings and use it to study the limiting behaviour of graph partition parameters under cut convergence. Pure colourings corresp…
math.PR2024
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…
math.PR2023★ 1 cited
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…