Random preorders and alignments
From MaRDI portal
Publication:960973
Recommendations
Cites work
- An asymptotic equivalent for the number of total preorders on a finite set
- Analytic combinatorics
- Central and local limit theorems applied to asymptotic enumeration
- Condorcet's paradox and the likelihood of its occurrence: Different perspectives on balanced preferences
- Generating random weak orders and the probability of a Condorcet winner
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 44603 (Why is no real title available?)
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 863491 (Why is no real title available?)
- Largest component in random combinatorial structures
- Random set partitions: Asymptotics of subset counts
- The number of weak orderings of a finite set
- Theory of relations. Transl. from the French by P. Clote
- Une théorie combinatoire des séries formelles
Cited in
(5)- Random orders
- Alignments of permutations: their number, mean number, and total number of cycles
- scientific article; zbMATH DE number 4134108 (Why is no real title available?)
- Logical limit laws for layered permutations and related structures
- Preface to the special issue of Permutation Patterns 2021 (PP2021)
This page was built for publication: Random preorders and alignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960973)