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], 2017, Volume 8, Issue 4, Pages 63–74
DOI: https://doi.org/10.4213/mvk239
(Mi mvk239)
 

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

Distribution of the length of aperiodicity segment in the graph of k-fold iteration of uniform random mapping

A. M. Zubkova, V. O. Mironkinb

a Steklov Mathematical Institute of RAS, Moscow
b National Research University Higher School of Economics, Moscow
Full-text PDF (246 kB) Citations (7)
References:
Abstract: The distribution of the length of the aperiodicity segment in a graph of k-fold iteration of random uniform mapping of a finite set is studied. Exact formulas for this distribution are obtained, the limit distribution of the normed length of aperiodicity segment is found for the case when the cardinality of the set tends to infinity.
Key words: equiprobable random mapping, iterations of random mapping, graph of a mapping, aperiodicity segment.
Received 15.III.2017
Bibliographic databases:
Document Type: Article
UDC: 519.212.2+519.719.2
Language: Russian
Citation: A. M. Zubkov, V. O. Mironkin, “Distribution of the length of aperiodicity segment in the graph of k-fold iteration of uniform random mapping”, Mat. Vopr. Kriptogr., 8:4 (2017), 63–74
Citation in format AMSBIB
\Bibitem{ZubMir17}
\by A.~M.~Zubkov, V.~O.~Mironkin
\paper Distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping
\jour Mat. Vopr. Kriptogr.
\yr 2017
\vol 8
\issue 4
\pages 63--74
\mathnet{http://mi.mathnet.ru/mvk239}
\crossref{https://doi.org/10.4213/mvk239}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3770675}
\elib{https://elibrary.ru/item.asp?id=32641309}
Linking options:
  • https://www.mathnet.ru/eng/mvk239
  • https://doi.org/10.4213/mvk239
  • https://www.mathnet.ru/eng/mvk/v8/i4/p63
  • This publication is cited in the following 7 articles:
    1. V. O. Mironkin, “Sloi v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 11:1 (2020), 101–114  mathnet  crossref
    2. V. O. Mironkin, “Sloi v grafe k-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matem. vopr. kriptogr., 10:1 (2019), 73–82  mathnet  crossref  elib
    3. V. O. Mironkin, “Collisions and incidence of vertices and components in the graph of k-fold iteration of the uniform random mapping”, Discrete Math. Appl., 31:4 (2021), 259–269  mathnet  crossref  crossref  mathscinet  isi  elib
    4. V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 10:3 (2019), 89–99  mathnet  crossref
    5. A. M. Zubkov, A. A. Serov, “Estimates of the mean size of the subset image under composition of random mappings”, Discrete Math. Appl., 28:5 (2018), 331–338  mathnet  crossref  crossref  mathscinet  isi  elib
    6. V. O. Mironkin, V. G. Mikhailov, “O mnozhestve obrazov k-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matem. vopr. kriptogr., 9:3 (2018), 99–108  mathnet  crossref  elib
    7. V. O. Mironkin, “Ob otsenkakh raspredeleniya dliny otrezka aperiodichnosti v grafe k-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, PDM, 2018, no. 42, 6–17  mathnet  crossref  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:539
    Full-text PDF :303
    References:80
    First page:8
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025