Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2019, Volume 10, Issue 1, Pages 73–82
DOI: https://doi.org/10.4213/mvk277 (Mi mvk277) 		 
This article is cited in 4 scientific papers (total in 4 papers)

Layers of the graph of $k$-fold iteration of the uniform random mapping

V. O. Mironkin

National Research University Higher School of Economics, Moscow
Full-text PDF (174 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk277
Abstract: The probabilistic characteristics of the graph of $k$-fold iteration of uniform random mapping are studied. Exact expressions and estimates for the distribution of the distances from the vertices to cycles are obtained. Formulas for expected values of the numbers of vertices on the given distance from cycles and for the distribution function of the height of a random vertex are derived.
Key words: uniform random mapping, iteration of random mapping, graph of a mapping, layer in a graph, cyclic vertices.
Received 30.V.2016, 30.XI.2018
Bibliographic databases:
Document Type: Article
UDC: 519.212.2+519.719.2
Language: Russian
Citation: V. O. Mironkin, “Layers of the graph of $k$-fold iteration of the uniform random mapping”, Mat. Vopr. Kriptogr., 10:1 (2019), 73–82
Citation in format AMSBIB
\Bibitem{Mir19}
\by V.~O.~Mironkin
\paper Layers of the graph of $k$-fold iteration of the uniform random mapping
\jour Mat. Vopr. Kriptogr.
\yr 2019
\vol 10
\issue 1
\pages 73--82
\mathnet{http://mi.mathnet.ru/mvk277}
\crossref{https://doi.org/10.4213/mvk277}
\elib{https://elibrary.ru/item.asp?id=37652162}
Linking options:
  • https://www.mathnet.ru/eng/mvk277
  • https://doi.org/10.4213/mvk277
  • https://www.mathnet.ru/eng/mvk/v10/i1/p73
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:302
    Full-text PDF :134
    References:33
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024