Random preorders and alignments

DOI10.1016/j.disc.2009.04.021zbMath1228.05028OpenAlexW2001357471MaRDI QIDQ960973

Peter J. Cameron, Dudley Stark, Mihyun Kang

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.021

zbMATH Keywords

distributionpreordersalignments

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Total orders (06A05)

Related Items

Logical limit laws for layered permutations and related structures, Preface to the special issue of Permutation Patterns 2021 (PP2021), Alignments of permutations: their number, mean number, and total number of cycles

Cites Work

• Theory of relations. Transl. from the French by P. Clote
• An asymptotic equivalent for the number of total preorders on a finite set
• Une théorie combinatoire des séries formelles
• Random set partitions: Asymptotics of subset counts
• Largest component in random combinatorial structures
• Condorcet's paradox and the likelihood of its occurrence: Different perspectives on balanced preferences
• The number of weak orderings of a finite set
• Central and local limit theorems applied to asymptotic enumeration
• Generating random weak orders and the probability of a Condorcet winner
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item