70 citations · 453 across the 51 of their papers we have counts for
6 papers · 2 filters
Asymptotic normality of the -core in random graphs
Svante Janson, Malwina J. Luczak
We study the -core of a random (multi)graph on vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used propertie…
The size of random fragmentation trees
S. Janson, R. Neininger
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who…
A functional limit theorem for the profile of search trees
Michael Drmota, Svante Janson, Ralph Neininger
We study the profile of random search trees including binary search trees and -ary search trees. Our main result is a functional limit theorem of the normalized profil…
On a random graph related to quantum theory
Svante Janson
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollobas, Janson and Riordan, which enables us to give…
Monotonicity, asymptotic normality and vertex degrees in random graphs
Svante Janson
We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degre…
Local limit theorems for finite and infinite urn models
Hsien-Kuei Hwang, Svante Janson
Local limit theorems are derived for the number of occupied urns in general finite and infinite urn models under the minimum condition that the variance tends to infinity. Our resu…