On random mapping patterns
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3151315 (Why is no real title available?)
- scientific article; zbMATH DE number 3657826 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- A note on the number of functional digraphs
- Enumeration of Linear Graphs for Mappings of Finite Sets
- Multisets of Aperiodic Cycles
- Probability Distributions Related to Random Mappings
- Probability of Indecomposability of a Random Mapping Function
- Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
- The Expected Number of Components Under a Random Mapping Function
- The number of functional digraphs
- The number of trees
Cited in
(11)- Counting finite models
- scientific article; zbMATH DE number 4209190 (Why is no real title available?)
- Limit theorem concerning random mapping patterns
- Gaussian limiting distributions for the number of components in combinatorial structures
- Largest component in random combinatorial structures
- Polynomial-delay generation of functional digraphs up to isomorphism
- Dividing permutations in the semiring of functional digraphs
- Asymptotic density in quasi-logarithmic additive number systems
- Grasping the connectivity of random functional graphs
- scientific article; zbMATH DE number 4013620 (Why is no real title available?)
- Pattern occurrences in random planar maps
This page was built for publication: On random mapping patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788742)
