70 citations · 226 across the 29 of their papers we have counts for
7 papers · 1 filter
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…
On percolation in random graphs with given vertex degrees
Svante Janson
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting t…
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…
Asymptotic equivalence and contiguity of some random graphs
Svante Janson
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w…
Convergence of some leader election algorithms
Svante Janson, Christian Lavault, Guy Louchard
We start with a set of n players. With some probability P(n,k), we kill n-k players; the other ones stay alive, and we repeat with them. What is the distribution of the number X_n…