Fragmentations with erasure

Abstract: We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then merging pairs of subintervals at the break points of the old partition. The $n$th partition then comprises $n+1$ subintervals with $n$ break points, and the empirical distribution of these points reveals a surprisingly rich structure, even when the splitting rule is completely deterministic. We consider both deterministic and randomized splitting rules and study the limiting behavior of the empirical distribution of the break points, from multiple angles.