Limit theorem for the size of an image of subset under compositions of random mappings
From MaRDI portal
Publication:1744358
DOI10.1515/DMA-2018-0013zbMath1397.60102OpenAlexW2797621517WikidataQ129995175 ScholiaQ129995175MaRDI QIDQ1744358
Andrey M. Zubkov, Aleksandr A. Serov
Publication date: 23 April 2018
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2018-0013
Exact enumeration problems, generating functions (05A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (2)
Estimates of the mean size of the subset image under composition of random mappings ⋮ Collisions and incidence of vertices and components in the graph of \(k\)-fold iteration of the uniform random mapping
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Images of subset of finite set under iterations of random mappings
- Images of a finite set under iterations of two random dependent mappings
- A comparison of cryptanalytic tradeoff algorithms
- Success probability of the Hellman trade-off
- A cryptanalytic time-memory trade-off
- Оценка характеристик методов балансировки времени-памяти-данных с помощью производящих функций числа частиц и общего числа частиц в процессе Гальтона - Ватсона
- Advances in Cryptology - CRYPTO 2003
- Probability Distributions Related to Random Mappings
This page was built for publication: Limit theorem for the size of an image of subset under compositions of random mappings