Cover Image

On likelihood of a Condorcet winner for uniformly random and independent voter preferences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Pittel, Boris
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05A05, 05A15, 05A16, 05C05, 06B05, 05C80, 05D40, 60C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The distribution of the maximum protection number in simply generated trees
by: Heuberger, Clemens, et al.
Published: (2023)

Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis
by: Aíza, Ricardo Gómez
Published: (2024)

Triangle-free graphs with the fewest independent sets
by: Buys, Pjotr, et al.
Published: (2025)

On the evolution of random integer compositions
by: Bevan, David, et al.
Published: (2023)

The likely maximum size of twin subtrees in a large random tree
by: Bona, Miklos, et al.
Published: (2023)

Families of prudent self-avoiding walks
by: Bousquet-Mélou, Mireille
Published: (2008)

Gibbs partitions and lattice paths
by: Bosio, Niccolò, et al.
Published: (2024)

On constrained matchings, stable under random preferences
by: Pittel, Boris
Published: (2024)

Counting records in a random, non-uniform, permutation
by: Pittel, Boris
Published: (2025)

Involution factorizations of Ewens random permutations
by: Burnette, Charles
Published: (2021)

Local limits of uniform triangulations with boundaries in high genus
by: Lions, Tanguy
Published: (2026)

Predicting the depth of the most recent common ancestor of a random sample of $k$ species: the impact of phylogenetic tree shape
by: Fuchs, Michael, et al.
Published: (2025)

On Card guessing after a single shelf shuffle
by: Kuba, Markus
Published: (2026)

Moments of permutation statistics by cycle type
by: Hamaker, Zachary, et al.
Published: (2025)

Card guessing after an asymmetric riffle shuffle
by: Kuba, Markus
Published: (2026)

Cores of partitions in rectangles
by: Ayyer, Arvind, et al.
Published: (2022)

Asymptotic height of Plancherel random trees
by: Zhang, Shengjun
Published: (2026)

Asymptotic normality of pattern occurrences in random maps
by: Drmota, Michael, et al.
Published: (2024)

On statistics of prime parking functions, Łukasiewicz paths, and quasisymmetric functions
by: Harris, Pamela E., et al.
Published: (2026)

Asymptotic enumeration of graph factors by cumulant expansion
by: Isaev, Mikhail, et al.
Published: (2025)

Saddle-Point Asymptotics for Chromatic and Tutte Polynomial Evaluations of Complete Multipartite Graphs
by: Sun, Zhiyang
Published: (2026)

Robustness of the Sauer-Spencer Theorem
by: Allen, Peter, et al.
Published: (2025)

Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
by: Greenhill, Catherine, et al.
Published: (2026)

On increasing sequences formed by points from a random finite subset of a hypercube
by: Pittel, Boris
Published: (2025)

Descent sets of cyclic permutations in types B and D
by: Liu, Kevin
Published: (2025)

Descents and flag major index on conjugacy classes of colored permutation groups without short cycles
by: Liu, Kevin, et al.
Published: (2025)

Bivariate asymptotics via random walks: application to large genus maps
by: Price, Andrew Elvey, et al.
Published: (2025)

Locally uniform random permutations with large increasing subsequences
by: Dubach, Victor
Published: (2023)

Trees of tangles in abstract separation systems
by: Elbracht, Christian, et al.
Published: (2019)

Cumulant expansion for counting Eulerian orientations
by: Isaev, Mikhail, et al.
Published: (2023)

Biembeddings of Archdeacon type: their full automorphism group and their number
by: Costa, Simone
Published: (2022)

Enumeration of rooted binary perfect phylogenies
by: Shiff, Chloe E., et al.
Published: (2024)

Asymptotics of self-overlapping permutations
by: Kirgizov, Sergey, et al.
Published: (2023)

Operahedron Lattices
by: Defant, Colin, et al.
Published: (2024)

A family of non-uniform distributions on the set of parking functions generated by random permutations
by: Pinsky, Ross G.
Published: (2025)

Thresholds for patterns in random permutations with a given number of inversions
by: Bevan, David, et al.
Published: (2023)

Note on down-set thresholds
by: Warnke, Lutz
Published: (2023)

Increasing Trees and the Degree-Chromatic Polynomial
by: Jumadildayev, Medet
Published: (2025)

Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees
by: Dejter, Italo J.
Published: (2019)

Monochromatic components with many edges in random graphs
by: Fox, Hannah, et al.
Published: (2025)