|
Zapiski Nauchnykh Seminarov POMI, 1995, Volume 223, Pages 162–180
(Mi znsl4386)
|
|
|
|
This article is cited in 9 scientific papers (total in 10 papers)
Combinatorial and algorithmic methods
Stick breaking process generated by virtual permutations with Ewens distribution
S. V. Kerova, N. V. Tsilevichb a St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
b Saint-Petersburg State University
Abstract:
Given a sequence $x$ of points in the unit interval, we associate with it a virtual permutation $w=w(x)$ (that is, a sequence $w$ of permutations $w_n\in\mathfrak S_n$ such that for all $n=1,2,\dots$, $w_{n-1}=w'_n$ is obtained from $w_n$ by removing the last element $n$ from its cycle). We introduce a detailed version of the well-known stick breaking process generating a random sequence $x$. It is proved that the associated random virtual permutation $w(x)$ has a Ewens distribution. Up to subsets of zero measure, the space $\mathfrak S_n=\varprojlim\mathfrak S_n$ of virtual permutations is identified with the cube $[0,1]^\infty$. Bibliography: 8 titles.
Received: 15.04.1995
Citation:
S. V. Kerov, N. V. Tsilevich, “Stick breaking process generated by virtual permutations with Ewens distribution”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part I, Zap. Nauchn. Sem. POMI, 223, POMI, St. Petersburg, 1995, 162–180; J. Math. Sci. (New York), 87:6 (1997), 4082–4093
Linking options:
https://www.mathnet.ru/eng/znsl4386 https://www.mathnet.ru/eng/znsl/v223/p162
|
Statistics & downloads: |
Abstract page: | 239 | Full-text PDF : | 124 |
|