|
This article is cited in 7 scientific papers (total in 7 papers)
Random $A$-Permutations: Convergence to a Poisson Process
A. L. Yakymiv Steklov Mathematical Institute, Russian Academy of Sciences
Abstract:
Suppose that $S_n$ is the permutation group of degree $n$, $A$ is a subset of the set of natural numbers $\mathbb N$, and $T_n=T_n(A)$ is the set of all permutations from $S_n$ whose cycle lengths belong to the set $A$. Permutations from $T_n$ are usually called $A$-permutations. We consider a wide class of sets $A$ of positive asymptotic density. Suppose that $\zeta_{mn}$ is the number of cycles of length $m$ of a random permutation uniformly distributed on $T_n$. It is shown in this paper that the finite-dimensional distributions of the random process $\{\zeta_{mn},m\in A\}$ weakly converge as $n\to\infty$ to the finite-dimensional distributions of a Poisson process on $A$.
Keywords:
random permutation, Poisson process, permutation group, permutation cycle, total variance distance, normal distribution.
Received: 24.11.2005 Revised: 19.09.2006
Citation:
A. L. Yakymiv, “Random $A$-Permutations: Convergence to a Poisson Process”, Mat. Zametki, 81:6 (2007), 939–947; Math. Notes, 81:6 (2007), 840–846
Linking options:
https://www.mathnet.ru/eng/mzm3744https://doi.org/10.4213/mzm3744 https://www.mathnet.ru/eng/mzm/v81/i6/p939
|
Statistics & downloads: |
Abstract page: | 497 | Full-text PDF : | 236 | References: | 61 | First page: | 6 |
|