The component counts of random injections (Q2223456)

Summary: A model of random injections is defined which has domain \(A\cup B\) and codomain \(A\cup C\), where \(A, B\) and \(C\) are mutually disjoint finite sets such that \(|B|\leqslant |C|\). The model encompasses both random permutations, which is the case \(B=C=\emptyset\), and random maximum matchings of a complete bipartite graph, which is the case \(A=\emptyset\). The possible components of random injections are cycles and paths. Results on the counts of cycles and paths of different sizes are obtained for this model.