most citedRounding of continuous random variables and oscillatory asymptotics

39 citations · 62 across the 8 of their papers we have counts for

collaborators

8 papers

math.PR20057 cited

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…

math.PR200539 cited

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…

math.CO200515 cited

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,…

math.CO2005

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…

math.PR20051 cited

A point process describing the component sizes in the critical window of the random graph evolution

Svante Janson, Joel Spencer

We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In partic…

math.PR2005

Individual displacements in hashing with coalesced chains

Svante Janson

We study the asymptotic distribution of the displacements in hashing with coalesced chains, for both late-insertion and early-insertion. Asymptotic formulas for means and variances…