RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Teor. Veroyatnost. i Primenen.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Teor. Veroyatnost. i Primenen., 2007, Volume 52, Issue 1, Pages 69–83 (Mi tvp5)  

This article is cited in 8 scientific papers (total in 8 papers)

Limit theorem for the general number of cycles in a random $A$-permutation

A. L. Yakymiv

Steklov Mathematical Institute, Russian Academy of Sciences

Abstract: Let $S_n$ be the symmetric group of all permutations of degree $n, A$ be some nonempty subset of the set of natural numbers $N$, and let $T_n=T_n(A)$ be the set of all permutations from $S_n$ with cycle lengths from $A$. The permutations from $T_n$ are called $A$-permutations. Let $\zeta_n$ be the general number of cycles in a random permutation uniformly distributed on $T_n$. In this paper, we find the way to prove the limit theorem for $\zeta_n$ starting with the asymptotics of $|T_n|$. The limit theorem obtained here is new in a number of cases when the asymptotics of $|T_n|$ is known but the limit theorem for $\zeta_n$ has not yet been proven by other methods. As has been noted by the author, $|T_n|/n!$ is the Karamata regularly varying function with index $\sigma-1$, where $\sigma>0$ is the density of the set $A$, in a number of papers of different authors. Proof of the limit theorem for $\zeta_n$ is the main goal of this paper, assuming none of the additional restrictions typical of previous investigations.

Keywords: asymptotic density of the set $A$, logarithmic density of the set $A$, random $A$-permutations, general number of cycles in random $A$-permutation, regularly varying functions, slowly varying functions, Tauberian theorem.

DOI: https://doi.org/10.4213/tvp5

Full text: PDF file (1091 kB)
References: PDF file   HTML file

English version:
Theory of Probability and its Applications, 2008, 52:1, 133–146

Bibliographic databases:

Received: 24.12.2005
Revised: 06.09.2006

Citation: A. L. Yakymiv, “Limit theorem for the general number of cycles in a random $A$-permutation”, Teor. Veroyatnost. i Primenen., 52:1 (2007), 69–83; Theory Probab. Appl., 52:1 (2008), 133–146

Citation in format AMSBIB
\Bibitem{Yak07}
\by A.~L.~Yakymiv
\paper Limit theorem for the general number of cycles in a~random $A$-permutation
\jour Teor. Veroyatnost. i Primenen.
\yr 2007
\vol 52
\issue 1
\pages 69--83
\mathnet{http://mi.mathnet.ru/tvp5}
\crossref{https://doi.org/10.4213/tvp5}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2354570}
\zmath{https://zbmath.org/?q=an:1145.60008}
\elib{http://elibrary.ru/item.asp?id=9466878}
\transl
\jour Theory Probab. Appl.
\yr 2008
\vol 52
\issue 1
\pages 133--146
\crossref{https://doi.org/10.1137/S0040585X97982827}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000254828600009}
\elib{http://elibrary.ru/item.asp?id=13569555}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-42949128091}


Linking options:
  • http://mi.mathnet.ru/eng/tvp5
  • https://doi.org/10.4213/tvp5
  • http://mi.mathnet.ru/eng/tvp/v52/i1/p69

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. L. Yakymiv, “On the Number of $A$-Mappings”, Math. Notes, 86:1 (2009), 132–139  mathnet  crossref  crossref  mathscinet  zmath  isi
    2. A. L. Yakymiv, “Limit Theorem for the Middle Members of Ordered Cycle Lengths in Random $A$-Permutations”, Theory Probab. Appl., 54:1 (2010), 114–128  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    3. A. L. Yakymiv, “A limit theorem for the logarithm of the order of a random $A$-permutation”, Discrete Math. Appl., 20:3 (2010), 247–275  mathnet  crossref  crossref  mathscinet  zmath  elib  elib
    4. A. L. Yakymiv, “Random $A$-permutations and Brownian motion”, Proc. Steklov Inst. Math., 282 (2013), 298–318  mathnet  crossref  crossref  mathscinet  isi  elib  elib
    5. A. L. Yakymiv, “On a number of components in a random $A$-mapping”, Theory Probab. Appl., 59:1 (2015), 114–127  mathnet  crossref  crossref  mathscinet  isi  elib  elib
    6. A. L. Yakymiv, “Tauberian theorem for generating functions of multiple series”, Theory Probab. Appl., 60:2 (2016), 343–347  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
    7. A. L. Yakymiv, “A Tauberian theorem for multiple power series”, Sb. Math., 207:2 (2016), 286–313  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    8. Betz V., Schaefer H., “The Number of Cycles in Random Permutations Without Long Cycles Is Asymptotically Gaussian”, ALEA-Latin Am. J. Probab. Math. Stat., 14:1 (2017), 427–444  mathscinet  zmath  isi
  • Теория вероятностей и ее применения Theory of Probability and its Applications
    Number of views:
    This page:361
    Full text:35
    References:35
    First page:10

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019