Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretnaya Matematika, 2005, Volume 17, Issue 2, Pages 56–69
DOI: https://doi.org/10.4213/dm98
(Mi dm98)
 

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

The Poisson approximation for the number of matches of values of a discrete function from chains

A. M. Shoitov
References:
Abstract: We find conditions which are sufficient for convergence of the distribution of the number of matches of values of a function considered on tuples of arguments taken from a sequence of independent identically distributed random variables to the Poisson law and estimate the convergence rate. We derive a series of corollaries of this result. In particular, in the equiprobable polynomial scheme we obtain Poisson limit theorems for the number of pairs of non-overlapping tuples with identical frequencies of occurrences of symbols and for the number of pairs of tuples with identical structure.
This research was supported by the Program of President of Russian Federation for supporting young Russian scientists, grant 2831.2003.09.
Received: 21.09.2004
English version:
Discrete Mathematics and Applications, 2005, Volume 15, Issue 3, Pages 241–254
DOI: https://doi.org/10.1515/156939205774464512
Bibliographic databases:
UDC: 519.2
Language: Russian
Citation: A. M. Shoitov, “The Poisson approximation for the number of matches of values of a discrete function from chains”, Diskr. Mat., 17:2 (2005), 56–69; Discrete Math. Appl., 15:3 (2005), 241–254
Citation in format AMSBIB
\Bibitem{Sho05}
\by A.~M.~Shoitov
\paper The Poisson approximation for the number of matches of values of a discrete function from chains
\jour Diskr. Mat.
\yr 2005
\vol 17
\issue 2
\pages 56--69
\mathnet{http://mi.mathnet.ru/dm98}
\crossref{https://doi.org/10.4213/dm98}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2167800}
\zmath{https://zbmath.org/?q=an:1113.60029}
\elib{https://elibrary.ru/item.asp?id=9135423}
\transl
\jour Discrete Math. Appl.
\yr 2005
\vol 15
\issue 3
\pages 241--254
\crossref{https://doi.org/10.1515/156939205774464512}
Linking options:
  • https://www.mathnet.ru/eng/dm98
  • https://doi.org/10.4213/dm98
  • https://www.mathnet.ru/eng/dm/v17/i2/p56
  • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:688
    Full-text PDF :609
    References:57
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024