70 citations · 453 across the 51 of their papers we have counts for
4 papers · 2 filters
Generalized Stirling permutations, families of increasing trees and urn models
Svante Janson, Markus Kuba, Alois Panholzer
Bona [2007+] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [1978]. Recently, Janson [2008+] sho…
On the size of identifying codes in binary hypercubes
Svante Janson, Tero Laihonen
We consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 199…
Plane recursive trees, Stirling permutations and an urn model
Svante Janson
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for th…
Connectedness in graph limits
Svante Janson
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well…