|
Zapiski Nauchnykh Seminarov POMI, 2005, Volume 326, Pages 59–84
(Mi znsl338)
|
|
|
|
This article is cited in 9 scientific papers (total in 9 papers)
Self-similar and Markov composition structures
A. V. Gnedina, J. Pitmanb a Utrecht University
b University of California, Berkeley
Abstract:
The bijection between composition structures and random closed
subsets of the unit interval implies that the composition structures
associated with $S\cap[0,1]$ for a self-similar random set
$S\subset{\mathbb R}_+$ are those which 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 1s in the sequence are the places 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 in previous papers, we identify
self-similar Markovian composition structures associated with the
two-parameter family of partition structures.
Received: 27.05.2005
Citation:
A. V. Gnedin, J. Pitman, “Self-similar and Markov composition structures”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part XIII, Zap. Nauchn. Sem. POMI, 326, POMI, St. Petersburg, 2005, 59–84; J. Math. Sci. (N. Y.), 140:3 (2007), 376–390
Linking options:
https://www.mathnet.ru/eng/znsl338 https://www.mathnet.ru/eng/znsl/v326/p59
|
Statistics & downloads: |
Abstract page: | 271 | Full-text PDF : | 61 | References: | 70 |
|