Probability of Indecomposability of a Random Mapping Function
From MaRDI portal
Publication:5849242
DOI10.1214/aoms/1177728496zbMath0065.11604OpenAlexW2070658523WikidataQ90805214 ScholiaQ90805214MaRDI QIDQ5849242
Publication date: 1955
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177728496
Related Items
Combinatorial results for semigroups of order-preserving mappings, The enumeration of rooted trees by total height, Digraph of the full transformation semigroup, Probabilities of First-Order Sentences about Unary Functions, A logical approach to asymptotic combinatorics I. First order properties, Some methods for computing component distribution probabilities in relational structures, Fuzzy intersection graphs, The number of connected sparsely edged uniform hypergraphs, Limiting distributions for the number of distinct component sizes in relational structures, A behavioral summary for completely random nets, Counting finite models, Card shuffling and a transformation on \(S_ n\), A LOADING-DEPENDENT MODEL OF PROBABILISTIC CASCADING FAILURE, Combinatorial problems of probability theory, Size distribution of the largest component of a random \(a\)-mapping, The chromatic number of random graphs at the double-jump threshold, A Random Graph With a Subcritical Number of Edges, On random mapping patterns, On the connectivity of random m-orientable graphs and digraphs, Some useful preservation theorems, Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions, On the number of components of fixed size in a random \(A\)-mapping
