Random A-permutations: Convergence to a Poisson process

被引:0
|
作者
A. L. Yakymiv
机构
[1] Steklov Mathematics Institute,
来源
Mathematical Notes | 2007年 / 81卷
关键词
random permutation; Poisson process; permutation group; permutation cycle; total variance distance; normal distribution;
D O I
暂无
中图分类号
学科分类号
摘要
Suppose that Sn is the permutation group of degree n, A is a subset of the set of natural numbers ℕ, and Tn(A) is the set of all permutations from Sn whose cycle lengths belong to the set A. Permutations from Tn are usually called A-permutations. We consider a wide class of sets A of positive asymptotic density. Suppose that ζmn is the number of cycles of length m of a random permutation uniformly distributed on Tn. It is shown in this paper that the finite-dimensional distributions of the random process {tzmn, m ε A} weakly converge as n → ∞ to the finite-dimensional distributions of a Poisson process on A.
引用
收藏
页码:840 / 846
页数:6
相关论文
共 50 条
  • [31] A functional limit theorem on powers of random permutations
    E. Manstavičius
    Lithuanian Mathematical Journal, 2009, 49 : 297 - 308
  • [32] COMPOUND POISSON PROCESS WITH A POISSON SUBORDINATOR
    Di Crescenzo, Antonio
    Martinucci, Barbara
    Zacks, Shelemyahu
    JOURNAL OF APPLIED PROBABILITY, 2015, 52 (02) : 360 - 374
  • [33] Feller coupling of cycles of permutations and Poisson spacings in inhomogeneous Bernoulli trials
    Najnudel, Joseph
    Pitman, Jim
    ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2020, 25 : 1 - 11
  • [34] Point process convergence for symmetric functions of high-dimensional random vectors
    Johannes Heiny
    Carolin Kleemann
    Extremes, 2024, 27 : 185 - 217
  • [35] Point process convergence for symmetric functions of high-dimensional random vectors
    Heiny, Johannes
    Kleemann, Carolin
    EXTREMES, 2024, 27 (02) : 185 - 217
  • [36] Continuity of limit surfaces of locally uniform random permutations
    Sjostrand, Jonas
    ADVANCES IN APPLIED MATHEMATICS, 2024, 154
  • [37] Fast generation of random permutations via networks simulation
    Czumaj, A
    Kanarek, P
    Kutylowski, M
    Lorys, K
    ALGORITHMICA, 1998, 21 (01) : 2 - 20
  • [38] Analysis of Efficient Random Permutations Generation for Security Applications
    Nasim, Zeba
    Bano, Zohra
    Ahmad, Musheer
    2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER ENGINEERING AND APPLICATIONS (ICACEA), 2015, : 337 - 341
  • [39] Indifferentiability of the Sum of Random Permutations Toward Optimal Security
    Lee, Jooyoung
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (06) : 4050 - 4054
  • [40] Large partial random permutations of conditionally convergent series
    Jin, Jiashun
    Kadane, Joseph B.
    Sarkar, Avranil
    STOCHASTICS-AN INTERNATIONAL JOURNAL OF PROBABILITY AND STOCHASTIC PROCESSES, 2010, 82 (05) : 427 - 443