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

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, 2022, Volume 34, Issue 4, Pages 28–35
DOI: https://doi.org/10.4213/dm1742 (Mi dm1742) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Probability that given vertices belong to the same connected component of random equiprobable mapping

A. M. Zubkova, P. V. Khalipovb

a Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
b United Consulting Group
Full-text PDF (379 kB) Citations (1) English version article
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1742
Abstract: The random equiprobable mappings of finite set $S$ into itself are considered. The probability that $k$ fixed elements of $S$ belong to the same connected component is studied. The limit of this probability as $|S|\to \infty$ is found.
Keywords: equiprobable random mappings of finite sets, random oriented graphs, connected components, limit theorems.
Received: 22.09.2022
Published: 02.12.2022
English version:
Discrete Mathematics and Applications, 2024, Volume 34, Issue 4, Pages 245–250
DOI: https://doi.org/10.1515/dma-2024-0021
Bibliographic databases:
Document Type: Article
UDC: 519.212.2
Language: Russian
Citation: A. M. Zubkov, P. V. Khalipov, “Probability that given vertices belong to the same connected component of random equiprobable mapping”, Diskr. Mat., 34:4 (2022), 28–35; Discrete Math. Appl., 34:4 (2024), 245–250
Citation in format AMSBIB
\Bibitem{ZubKha22}
\by A.~M.~Zubkov, P.~V.~Khalipov
\paper Probability that given vertices belong to the same connected component of random equiprobable mapping
\jour Diskr. Mat.
\yr 2022
\vol 34
\issue 4
\pages 28--35
\mathnet{http://mi.mathnet.ru/dm1742}
\crossref{https://doi.org/10.4213/dm1742}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=4791055}
\transl
\jour Discrete Math. Appl.
\yr 2024
\vol 34
\issue 4
\pages 245--250
\crossref{https://doi.org/10.1515/dma-2024-0021}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=001295456100007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85201117153}
Linking options:
  • https://www.mathnet.ru/eng/dm1742
  • https://doi.org/10.4213/dm1742
  • https://www.mathnet.ru/eng/dm/v34/i4/p28
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:447
    Full-text PDF :118
    References:120
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026