Teoriya Veroyatnostei i ee Primeneniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
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

Teoriya Veroyatnostei i ee Primeneniya, 2002, Volume 47, Issue 2, Pages 350–357
DOI: https://doi.org/10.4213/tvp3654 (Mi tvp3654) 		 
This article is cited in 3 scientific papers (total in 3 papers)

Short Communications

Poisson-type limit theorems for the number of incomplete matches of $s$-patterns

V. G. Mikhailov

Steklov Mathematical Institute, Russian Academy of Sciences
Full-text PDF (901 kB) Citations (3)
DOI: https://doi.org/10.4213/tvp3654
Abstract: The principal result of the paper is a limit theorem for the vector of incomplete matches (with a given number of mismatches) of $s$-patterns in two sequences of independent identically distributed random variables. The form of the joint limiting distribution is described and sufficient convergence conditions are given. Explicit estimates of the closeness to an accompanying multivariate compound Poisson distribution are obtained. The proof is based on a local version of the Chen–Stein method to evaluate the accuracy of the Poisson approximation for the distribution of a tuple of dependent random indicators.
Keywords: matches and repetitions of patterns, incomplete matches, limit compound Poisson distribution, explicit estimates of the convergence rate, Chen–Stein method.
Received: 05.07.1999
English version:
Theory of Probability and its Applications, 2003, Volume 47, Issue 2, Pages 343–351
DOI: https://doi.org/10.1137/S0040585X97979706
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: V. G. Mikhailov, “Poisson-type limit theorems for the number of incomplete matches of $s$-patterns”, Teor. Veroyatnost. i Primenen., 47:2 (2002), 350–357; Theory Probab. Appl., 47:2 (2003), 343–351
Citation in format AMSBIB
\Bibitem{Mik02}
\by V.~G.~Mikhailov
\paper Poisson-type limit theorems for the number of incomplete matches of $s$-patterns
\jour Teor. Veroyatnost. i Primenen.
\yr 2002
\vol 47
\issue 2
\pages 350--357
\mathnet{http://mi.mathnet.ru/tvp3654}
\crossref{https://doi.org/10.4213/tvp3654}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2001840}
\zmath{https://zbmath.org/?q=an:1033.60026}
\transl
\jour Theory Probab. Appl.
\yr 2003
\vol 47
\issue 2
\pages 343--351
\crossref{https://doi.org/10.1137/S0040585X97979706}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000183800700015}
Linking options:
  • https://www.mathnet.ru/eng/tvp3654
  • https://doi.org/10.4213/tvp3654
  • https://www.mathnet.ru/eng/tvp/v47/i2/p350
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Теория вероятностей и ее применения Theory of Probability and its Applications
    Statistics & downloads:
    Abstract page:279
    Full-text PDF :143
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024