70 citations · 453 across the 51 of their papers we have counts for
8 papers · 1 filter
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 probability that a random multigraph is simple
Svante Janson
Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with t…
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…
Complex interpolation of compact operators mapping into the couple (FL^{\infty},FL_{1}^{\infty})
Michael Cwikel, Svante Janson
If (A_0,A_1) and (B_0,B_1) are Banach couples and a linear operator T from A_0 + A_1 to B_0 + B_1 maps A_0 compactly into B_0 and maps A_1 boundedly into B_1, does T necessarily al…
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…