554 citations · 2.3k across the 174 of their papers we have counts for
9 papers · 1 filter
Partial fillup and search time in LC tries
Svante Janson, Wojciech Szpankowski
Andersson and Nilsson introduced in 1993 a level-compressed trie (in short: LC trie) in which a full subtree of a node is compressed to a single node of degree being the size of th…
Congruence properties of depths in some random trees
Svante Janson
Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number…
Rounding of continuous random variables and oscillatory asymptotics
Svante Janson
We study the characteristic function and moments of the integer-valued random variable , where is a continuous random variables. The results can be regarded…
A simple solution to the k-core problem
Svante Janson, Malwina Luczak
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences,…
Rainbow Hamilton cycles in random regular graphs
Svante Janson, Nicholas Wormald
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colou…
Spread-out percolation in R^d
Bela Bollobas, Svante Janson, Oliver Riordan
Let be either or the points of a Poisson process in of intensity 1. Given parameters and , join each pair of points of within distance independently…