The Expected Number of Components Under a Random Mapping Function
From MaRDI portal
Publication:5827378
DOI10.2307/2307900zbMath0055.37001OpenAlexW4254608674MaRDI QIDQ5827378
Publication date: 1954
Full work available at URL: https://doi.org/10.2307/2307900
Related Items
Combinatorial results for semigroups of order-preserving mappings, Nonconvergence, undecidability, and intractability in asymptotic problems, Probabilities of First-Order Sentences about Unary Functions, Some methods for computing component distribution probabilities in relational structures, Limit theorem concerning random mapping patterns, A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields, A behavioral summary for completely random nets, Phase transitions in the dynamics of slow random monads, GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS, Combinatorial problems of probability theory, The expected linearity of a simple equivalence algorithm, Current trends and open problems in arithmetic dynamics, The simulation of random processes on digital computers: Unavoidable order, On random mapping patterns, On the connectivity of random m-orientable graphs and digraphs, Some useful preservation theorems
