Binary sequential representations of random partitions

Random partitions can be thought of as a consistent family of exchangeable random partitions of the sets {1,2,...,n} for n≥1. Historically, random partitions were constructed by sampling an infinite population of types and partitioning individuals of the same type into a single class. A particularly tractable way to construct random partitions is via random sequences of 0s and 1s. The only random partition derived from an independent 0-1 …