Limit theorem for the size of an image of subset under compositions of random mappings

DOI10.1515/DMA-2018-0013MaRDI QIDQ1744358zbMATH OpenOpenAlexWikidataFDO

Authors A. M. Zubkov, A. 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

zbMATH Keywords

asymptotic normalitycompositions of random mappingsrandom equiprobable mappings

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Images of a finite set under iterations of two random dependent mappings
• Random mappings with component sizes from a given set
• Estimates of the mean size of the subset image under composition of random mappings
• Images of subset of finite set under iterations of random mappings
• scientific article; zbMATH DE number 3994629

Cites work

• A comparison of cryptanalytic tradeoff algorithms
• A cryptanalytic time-memory trade-off
• Advances in Cryptology - CRYPTO 2003
• Estimation of the characteristics of time-memory-data tradeoff methods via generating functions of the number of particles and the total number of particles in the Galton-Watson process
• scientific article; zbMATH DE number 3978019 (Why is no real title available?)
• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• scientific article; zbMATH DE number 1199736 (Why is no real title available?)
• Images of a finite set under iterations of two random dependent mappings
• Images of subset of finite set under iterations of random mappings
• Probability Distributions Related to Random Mappings
• Success probability of the Hellman trade-off

Cited in

(7)

• Limit theorem concerning random mapping patterns
• 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
• Images of subset of finite set under iterations of random mappings
• Images of a finite set under iterations of two random dependent mappings
• Асимптотическое поведение мощности полного прообраза образа случайного множества при итерациях отображений конечного множества
• Chair of Mathematical Statistics and Random Processes

This page was built for publication: Limit theorem for the size of an image of subset under compositions of random mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744358)