Interlacing sequences resulting from an interval split-merge dynamics and the induced probability measures
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 nth partition then comprises n+1 subintervals with n break points, which inherently possess an interlacing property. 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 we study from multiple angles the limiting behavior of the empirical distribution of the break points.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.