The Expected Number of Components Under a Random Mapping Function
From MaRDI portal
Cited in
(18)- Random maps with sociological flavor
- Limit theorem concerning random mapping patterns
- Combinatorial results for semigroups of order-preserving mappings
- Phase transitions in the dynamics of slow random monads
- On random mapping patterns
- Nonconvergence, undecidability, and intractability in asymptotic problems
- Some methods for computing component distribution probabilities in relational structures
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- The expected linearity of a simple equivalence algorithm
- Combinatorial problems of probability theory
- Some useful preservation theorems
- The simulation of random processes on digital computers: Unavoidable order
- A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields
- Current trends and open problems in arithmetic dynamics
- Decomposition and factorisation of transients in functional graphs
- On the connectivity of random m-orientable graphs and digraphs
- Probabilities of First-Order Sentences about Unary Functions
- A behavioral summary for completely random nets
This page was built for publication: The Expected Number of Components Under a Random Mapping Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5827378)
