The Expected Number of Components Under a Random Mapping Function
From MaRDI portal
Publication:5827378
DOI10.2307/2307900zbMath0055.37001MaRDI 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, On random mapping patterns, The simulation of random processes on digital computers: Unavoidable order, On the connectivity of random m-orientable graphs and digraphs, Nonconvergence, undecidability, and intractability in asymptotic problems, Some methods for computing component distribution probabilities in relational structures, Limit theorem concerning random mapping patterns, A behavioral summary for completely random nets, Combinatorial problems of probability theory, The expected linearity of a simple equivalence algorithm, Probabilities of First-Order Sentences about Unary Functions, Some useful preservation theorems