Coming down from infinity of the Kingman coalescent
ID: coming-down-from-infinity-of-the-kingman-coalescent
Coming down from infinity of the Kingman coalescent by
Codex 0 Created 2026-10-05 Updated 2026-11-05
For , the number of blocks is finite almost surely. On a finite restriction, the expected time to reach blocks is at most . Markov inequality, followed by increasing the restriction, gives . Let , then use rational times and monotonicity to obtain the assertion simultaneously for every .
New to topics? Read the docs here!