English
Related papers

Related papers: Three Candidate Plurality is Stablest for Correlat…

200 papers

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

Probability · Mathematics 2018-12-12 Pieter C. Allaart , Jose A. Islas

We study the problem of multiple hypothesis testing for multidimensional data when inter-correlations are present. The problem of multiple comparisons is common in many applications. When the data is multivariate and correlated, existing…

Statistics Theory · Mathematics 2015-06-02 Mahdis Azadbakhsh , Xin Gao , Hanna Jankowski

We study the stability of the O(N) fixed point in three dimensions under perturbations of the cubic type. We address this problem in the three cases $N=2,3,4$ by using finite size scaling techniques and high precision Monte Carlo…

Condensed Matter · Physics 2008-11-26 M. Caselle , M. Hasenbusch

Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule…

Computer Science and Game Theory · Computer Science 2015-02-17 Palash Dey , Y. Narahari

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

Combinatorics · Mathematics 2014-03-07 Nikos Frantzikinakis , Bernard Host

The stability of Bernstein's characterization of Gaussian distributions is extended to vectors by utilizing characteristic functions. Stability is used to develop a soft doubling argument that establishes the optimality of Gaussian vectors…

Information Theory · Computer Science 2023-08-15 Mohammad Mahdi Mahvari , Gerhard Kramer

We investigate the three-state majority-vote model with noise on scale-free and regular networks. In this model, an individual selects an opinion equal to the opinion of the majority of its neighbors with probability $1 - q$ and opposite to…

Statistical Mechanics · Physics 2019-05-14 André L. M. Vilela , Bernardo J. Zubillaga , Chao Wang , Minggang Wang , Ruijin Du , H. Eugene Stanley

In this paper we partially resolve Hall's conjecture about the distribution of random triangles. We consider the probability that three points chosen uniformly at random, in a bounded convex region of the plane, form an acute triangle.…

Probability · Mathematics 2019-06-21 Gabriel Khan

The two main topics of this paper are the introduction of the "optimally tuned improper maximum likelihood estimator" (OTRIMLE) for robust clustering based on the multivariate Gaussian model for clusters, and a comprehensive simulation…

Methodology · Statistics 2017-01-31 Pietro Coretto , Christian Hennig

We study the structure of satisfying assignments of a random 3-SAT formula. In particular, we show that a random formula of density 4.453 or higher almost surely has no non-trivial "core" assignments. Core assignments are certain partial…

Computational Complexity · Computer Science 2008-09-01 Elitza Maneva , Alistair Sinclair

In 1992, Bollob\'as and Meir showed that for every $k \geq 1$ there exists a constant $c_k$ such that, for any $n$ points in the $k$-dimensional unit cube $[0, 1]^k$, one can find a tour $x_1, \dots, x_n$ through these $n$ points with…

Combinatorics · Mathematics 2026-03-24 Alexey Gordeev

Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…

Computational Complexity · Computer Science 2012-08-03 Maria Ercsey-Ravasz , Zoltan Toroczkai

We investigate the complexity of approximately counting stable matchings in the $k$-attribute model, where the preference lists are determined by dot products of "preference vectors" with "attribute vectors", or by Euclidean distances…

Computational Complexity · Computer Science 2012-04-20 Prasad Chebolu , Leslie Ann Goldberg , Russell Martin

Motivated by the need for efficient estimation of conditional expectations, we consider a least-squares function approximation problem with heavily polluted data. Existing methods that are effective in the small-noise regime are suboptimal…

Machine Learning · Statistics 2026-05-26 Ben Adcock , Bernhard Hientzsch , Akil Narayan , Yiming Xu

In the Correlation Clustering problem we are given $n$ nodes, and a preference for each pair of nodes indicating whether we prefer the two endpoints to be in the same cluster or not. The output is a clustering inducing the minimum number of…

Data Structures and Algorithms · Computer Science 2025-01-07 Nick Fischer , Evangelos Kipouridis , Jonas Klausen , Mikkel Thorup

The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study an asymmetric setting where voters face varying…

Computer Science and Game Theory · Computer Science 2025-10-22 Reshef Meir , Ganesh Ghalme

Bell's Theorem started with two qubits, spins $1/2$. It is a no-go statement on classical (local causal) models of quantum correlations. Only after 25 years, it turned out that for three qubits the situation is even more mind boggling.…

Quantum Physics · Physics 2014-10-16 Wieslaw Laskowski , Junghee Ryu , Marek Zukowski

We give a multivariate generalization of Borell's noise stability theorem for Gaussian vectors. As a consequence we recover two inequalities, also due to Borell, for exit times of the Ornstein-Uhlenbeck process.

Probability · Mathematics 2013-07-31 Joe Neeman

The Borda voting rule is a positional scoring rule for $z$ candidates such that in each vote, the first candidate receives $z-1$ points, the second $z-2$ points and so on. The winner in the Borda rule is the candidate with highest total…

Computer Science and Game Theory · Computer Science 2020-10-08 Yiheng Shen , Pingzhong Tang , Yuan Deng

There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known…

Probability · Mathematics 2012-06-19 David B. Wilson