The metastability threshold for modified bootstrap percolation in dimensions.
Trees and matchings from point processes.
Local bootstrap percolation.
Random subnetworks of random sorting networks.
The jammed phase of the Biham-Middleton-Levine traffic model.
Lipschitz percolation.
Poisson matching
Suppose that red and blue points occur as independent homogeneous Poisson processes in ℝ. We investigate translation-invariant schemes for perfectly matching the red points to the blue points. For any such scheme in dimensions =1, 2, the matching distance from a typical point to its partner must have infinite /2th moment, while in dimensions ≥3 there exist schemes where has finite exponential moments. The Gale–Shapley stable marriage is one natural matching scheme, obtained by iteratively matching...
Page 1