On a simple formula for random mappings and its applications
- 1 June 1980
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 17 (2) , 403-414
- https://doi.org/10.2307/3213029
Abstract
A random mapping of a countable set N into itself is studied. An explicit formula is found for the probability that a subset of N will not contain cycles of the mapping. This formula is applied then for a detailed asymptotic analysis of two special mappings.Keywords
This publication has 5 references indexed in Scilit:
- Epidemic process on a random graph: some preliminary resultsJournal of Applied Probability, 1977
- Epidemic process on a random graph: some preliminary resultsJournal of Applied Probability, 1977
- On Extreme Metric Characteristics of a Random Graph. II. Limit DistributionsTheory of Probability and Its Applications, 1975
- On Extreme Metric Parameters of a Random Graph. I. Asymptotic EstimatesTheory of Probability and Its Applications, 1975
- Random Mappings with a Single Attracting CenterTheory of Probability and Its Applications, 1971