39 citations · 62 across the 9 of their papers we have counts for
6 papers · 1 filter
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 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…
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…
Branching Processes, and Random-Cluster Measures on Trees
Geoffrey Grimmett, Svante Janson
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite path…
Quicksort with unreliable comparisons: a probabilistic analysis
L. Alonso, P. Chassaing, F. Gillet +3
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.