Related papers: Three Candidate Plurality is Stablest for Correlat…
Mixture models have received considerable attention recently and Newton [Sankhy\={a} Ser. A 64 (2002) 306--322] proposed a fast recursive algorithm for estimating a mixing distribution. We prove almost sure consistency of this recursive…
We consider stable three-dimensional matchings of three categories of agents, such as women, men and dogs. This was suggested long ago by Knuth (1976), but very little seems to have been published on this problem. Based on computer…
Given $n$ men, $n$ women, and $n$ dogs, each man has an incomplete preference list of women, each woman does an incomplete preference list of dogs, and each dog does an incomplete preference list of men. We understand a family as a triple…
We estimate the Hurst parameter $H \in (0,1)$ of a fractional Brownian motion from discrete noisy data, observed along a high frequency sampling scheme. When the intensity $\tau_n$ of the noise is smaller in order than $n^{-H}$ we establish…
We show that for all $\varepsilon>0$, for sufficiently large $q\in\mathbb{N}$ power of $2$, for all $\delta>0$, it is NP-hard to distinguish whether a given $2$-Prover-$1$-Round projection game with alphabet size $q$ has value at least…
The current series of papers is concerned with stochastic stability of monotone dynamical systems by identifying the basic dynamical units that can survive in the presence of noise interference. In the first of the series, for the…
We investigate the site percolation transition in two strongly correlated systems in three dimensions: the massless harmonic crystal and the voter model. In the first case we start with a Gibbs measure for the potential, $U=\frac{J}{2}…
Benjamini, Kalai and Schramm showed that a monotone function $f : \{-1,1\}^n \to \{-1,1\}$ is noise stable if and only if it is correlated with a half-space (a set of the form $\{x: \langle x, a\rangle \le b\}$). We study noise stability in…
Here, the model of non-equilibrium model with two states ($-1,+1$) and a noise $q$ on simple square lattices proposed for M.J. Oliveira (1992) following the conjecture of up-down symmetry of Grinstein and colleagues (1985) is studied and…
Correlation Clustering (CC) is a fundamental unsupervised learning primitive whose strongest LP-based approximation guarantees require $\Theta(n^3)$ triangle inequality constraints and are prohibitive at scale. We initiate the study of…
The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. The original proof, announced in 1998 and published in 2006, is long and…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
A voting rule is a Condorcet extension if it returns a candidate that beats every other candidate in pairwise majority comparisons whenever one exists. Condorcet extensions have faced criticism due to their susceptibility to…
Understanding the nature of strategic voting is the holy grail of social choice theory, where game-theory, social science and recently computational approaches are all applied in order to model the incentives and behavior of voters. In a…
This paper presents DiffSum, a simple post-election risk-limiting ballot-polling audit for two-candidate plurality elections. DiffSum sequentially draws ballots (without replacement) until the numbers $a$, $b$, of votes for candidates $A$,…
A prototype model of a stochastic one-variable system with a linear restoring force driven by two cross-correlated multiplicative and additive Gaussian white noises was considered earlier [S. I. Denisov et al., Phys. Rev. E 68, 046132…
We revisit the problem of computing with noisy information considered in Feige et al. 1994, which includes computing the OR function from noisy queries, and computing the MAX, SEARCH and SORT functions from noisy pairwise comparisons. For…
Studying complexity of various bribery problems has been one of the main research focus in computational social choice. In all the models of bribery studied so far, the briber has to pay every voter some amount of money depending on what…
We present an algorithm for strongly refuting smoothed instances of all Boolean CSPs. The smoothed model is a hybrid between worst and average-case input models, where the input is an arbitrary instance of the CSP with only the negation…
A competition model on $\N^{2}$ between three clusters and governed by directed last passage percolation is considered. We prove that coexistence, i.e. the three clusters are simultaneously unbounded, occurs with probability $6-8\log2$.…