Limit theorem concerning random mapping patterns
From MaRDI portal
Publication:1110176
Mapping patterns may be represented by unlabelled directed graphs in which each point has out-degree one. Assuming uniform probability distribution on the set of all mapping patterns on n points, we obtain limit distributions of some characteristics associated with the graphs of mapping patterns (connected and disconnected), as \(n\to \infty\). In particular, we study the number of points belonging to cycles, the number of cycles and components having prescribed (fixed) number of points and the total number of components.
Recommendations
- scientific article; zbMATH DE number 4013620
- scientific article; zbMATH DE number 5652649
- On random mapping patterns
- scientific article; zbMATH DE number 4102250
- On the random mapping statistics
- scientific article; zbMATH DE number 3956091
- Limit theorem for the size of an image of subset under compositions of random mappings
- A probabilistic theory of random maps
- scientific article; zbMATH DE number 991953
Cites work
- A note on the number of functional digraphs
- A Problem of the Allocation of Particles in Cells and Random Mappings
- Asymptotic Methods in Enumeration
- scientific article; zbMATH DE number 3860065 (Why is no real title available?)
- scientific article; zbMATH DE number 3307941 (Why is no real title available?)
- Multisets of Aperiodic Cycles
- On random mapping patterns
- Probability Distributions Related to Random Mappings
- The Expected Number of Components Under a Random Mapping Function
- The number of functional digraphs
- The number of trees
Cited in
(9)- Nonuniform random transformations.
- Periodic points and tail lengths of split polynomial maps modulo primes
- Pattern occurrences in random planar maps
- scientific article; zbMATH DE number 4013620 (Why is no real title available?)
- Limit distributions of the number of cyclic points of stable random mappings
- scientific article; zbMATH DE number 17682 (Why is no real title available?)
- Images and Preimages in Random Mappings
- Large trees in a random mapping pattern
- An algorithm for uniform generation of unlabeled (Pólya) trees
This page was built for publication: Limit theorem concerning random mapping patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1110176)