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, 2008, Volume 20, Issue 4, Pages 113–119
DOI: https://doi.org/10.4213/dm1031
(Mi dm1031)
 

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

On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence

V. G. Mikhailov
Full-text PDF (92 kB) Citations (3)
References:
Abstract: In a long enough sequence of discrete random variables, as a rule, an $s$-tuple exists of nontrivial structure, that is, a tuple with at least one repeated symbol. We consider the case where the sequence consists of $n+s-1$ independent random variables taking the values $1,\dots,N$ with equal probabilities. It is shown that as $n\to\infty$, $ns^3N^{-2}\to0$ the probability of that in the sequence $s$-tuples exist with the same nontrivial structure is equal to $1-(1+n/N)^se^{-sn/N}(1+o(1))$.
Received: 28.11.2006
Revised: 15.09.2008
English version:
Discrete Mathematics and Applications, 2008, Volume 18, Issue 6, Pages 563–568
DOI: https://doi.org/10.1515/DMA.2008.042
Bibliographic databases:
Document Type: Article
UDC: 519.2
Language: Russian
Citation: V. G. Mikhailov, “On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence”, Diskr. Mat., 20:4 (2008), 113–119; Discrete Math. Appl., 18:6 (2008), 563–568
Citation in format AMSBIB
\Bibitem{Mik08}
\by V.~G.~Mikhailov
\paper On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a~random sequence
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 4
\pages 113--119
\mathnet{http://mi.mathnet.ru/dm1031}
\crossref{https://doi.org/10.4213/dm1031}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2500609}
\zmath{https://zbmath.org/?q=an:1175.60052}
\elib{https://elibrary.ru/item.asp?id=20730271}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 6
\pages 563--568
\crossref{https://doi.org/10.1515/DMA.2008.042}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-57349186026}
Linking options:
  • https://www.mathnet.ru/eng/dm1031
  • https://doi.org/10.4213/dm1031
  • https://www.mathnet.ru/eng/dm/v20/i4/p113
  • 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
    Дискретная математика
    Statistics & downloads:
    Abstract page:416
    Full-text PDF :179
    References:46
    First page:14
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024