The component counts of random injections

DOI10.37236/9496MaRDI QIDQ2223456zbMATH OpenOpenAlexFDO

Authors Dudley Stark

Publication date 29 January 2021

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.37236/9496

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

cycles of a permutationrandom permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38) Random graphs (graph-theoretic aspects) (05C80)

Review text

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.

Recommendations

• The component counts of random functions
• Some nonequiprobable models of random permutations
• Random Mappings of Finite Sets with a Known Number of Components
• Asymptotic expansions for the distribution of the number of components in random mappings and partitions
• The distribution and moments of the number of components of a random function

Cites work

• Central limit theorems for some set partition statistics
• Combinatorics of permutations
• Hamilton Cycles in Random Regular Digraphs
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Independent process approximations for random combinatorial structures
• Logarithmic combinatorial structures: A probabilistic approach
• Some Probabilistic Aspects of Set Partitions
• The cycle structure of random permutations
• The population structure associated with the Ewens sampling formula
• The sampling theory of selectively neutral alleles
• The Structure of Random Partitions of Large Integers
• Une théorie combinatoire des séries formelles
• Using Lovász local lemma in the space of random injections

Cited in

(1)

• The component counts of random functions

This page was built for publication: The component counts of random injections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223456)