88 citations · 92 across the 5 of their papers we have counts for
5 papers · 1 filter
Phase transition for parking blocks, Brownian excursion and coalescence
Philippe Chassaing, Guy Louchard
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m<n empty places. For a non computer science-minded reader, we sh…
Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms
Philippe Chassaing, Regine Marchand
Starting with a monodisperse configuration with size-1 particles, an additive Marcus-Lushnikov process evolves until it reaches its final state (a unique particle with mass …
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.
Local limit of labeled trees and expected volume growth in a random quadrangulation
Philippe Chassaing, Bergfinnur Durhuus
Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembl…
The center of mass of the ISE and the Wiener index of trees
Svante Janson, Philippe Chassaing
We derive the distribution of the center of mass of the integrated superBrownian excursion (ISE) {from} the asymptotic distribution of the Wiener index for simple trees. Equiva…