Abstract

The bijection between composition structures and random closed subsets of the unit interval implies that the composition structures associated with S ⋂ [0, 1] for a self-similar random set S ⊂ ℝ+ are those that are consistent with respect to a simple truncation operation. Using the standard coding of compositions by finite strings of binary digits starting with a 1, the random composition of n is defined by the first n terms of a random binary sequence of infinite length. The locations of 1’s in the sequence are the positions visited by an increasing time-homogeneous Markov chain on the positive integers if and only if S = exp(−W) for some stationary regenerative random subset W of the real line. Complementing our study presented in previous papers, we identify self-similar Markov composition structures associated with the two-parameter family of partition structures. Bibliography: 19 titles.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.