English
Related papers

Related papers: Three Candidate Plurality is Stablest for Correlat…

200 papers

Control of linear dynamics with multiplicative noise naturally introduces robustness against dynamical uncertainty. Moreover, many physical systems are subject to multiplicative disturbances. In this work we show how these dynamics can be…

Optimization and Control · Mathematics 2023-12-27 Peter Coppens , Panagiotis Patrinos

We investigate the q-voter model with stochastic noise arising from independence on complex networks. Using the pair approximation, we provide a comprehensive, mathematical description of its behavior and derive a formula for the critical…

Physics and Society · Physics 2018-05-01 Arkadiusz Jędrzejewski

We consider the stabilization of an unstable discrete-time linear system that is observed over a channel corrupted by continuous multiplicative noise. Our main result shows that if the system growth is large enough, then the system cannot…

Systems and Control · Computer Science 2016-12-22 Jian Ding , Yuval Peres , Gireeja Ranade , Alex Zhai

We consider election scenarios with incomplete information, a situation that arises often in practice. There are several models of incomplete information and accordingly, different notions of outcomes of such elections. In one well-studied…

Computer Science and Game Theory · Computer Science 2016-10-27 Palash Dey , Neeldhara Misra

The Gaussian noise-stability of a set A in R^n is defined by S_rho(A) = P (X in A and Y in A) where X and Y are standard Gaussian vectors whose correlation is rho. Borell's inequality states that for all 0 < rho < 1, among all sets A with a…

Probability · Mathematics 2015-05-06 Ronen Eldan

High-probability guarantees in stochastic optimization are often obtained only under strong noise assumptions such as sub-Gaussian tails. We show that such guarantees can also be achieved under the weaker assumption of bounded variance by…

Optimization and Control · Mathematics 2025-12-23 Jiaming Liang

The multi-bubble isoperimetric conjecture in $n$-dimensional Euclidean and spherical spaces from the 1990's asserts that standard bubbles uniquely minimize total perimeter among all $q-1$ bubbles enclosing prescribed volume, for any $q \leq…

Differential Geometry · Mathematics 2025-04-22 Emanuel Milman , Joe Neeman

Questions of noise stability play an important role in hardness of approximation in computer science as well as in the theory of voting. In many applications, the goal is to find an optimizer of noise stability among all possible partitions…

Probability · Mathematics 2017-02-17 Anindya De , Elchanan Mossel , Joe Neeman

For smooth projective 3-folds of general type, we prove that the relative canonical stability $\mu_s(3)\leq 8$. This is induced from our improved result of Koll\'ar: the m-canonical map of a smooth projective 3-fold of general type is…

Algebraic Geometry · Mathematics 2007-05-23 Meng Chen

The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds on dynamic data structures and graph problems. This line of work was initiated by P\v{a}tra\c{s}cu (STOC 2010) who reduced 3SUM to an offline…

Data Structures and Algorithms · Computer Science 2019-01-15 Tsvi Kopelowitz , Seth Pettie , Ely Porat

Variable clustering is important for explanatory analysis. However, only few dedicated methods for variable clustering with the Gaussian graphical model have been proposed. Even more severe, small insignificant partial correlations due to…

Applications · Statistics 2018-06-18 Daniel Andrade , Akiko Takeda , Kenji Fukumizu

Suppose $Y^{n}$ is obtained by observing a uniform Bernoulli random vector $X^{n}$ through a binary symmetric channel. Courtade and Kumar asked how large the mutual information between $Y^{n}$ and a Boolean function $\mathsf{b}(X^{n})$…

Information Theory · Computer Science 2016-07-11 Nir Weinberger , Ofer Shayevitz

In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…

Optimization and Control · Mathematics 2013-10-09 Roberto Cominetti , José A. Soto , José Vaisman

We prove a robust version of Freiman's $3k - 4$ theorem on the restricted sumset $A+_{\Gamma}B$, which applies when the doubling constant is at most $\tfrac{3+\sqrt{5}}{2}$ in general and at most $3$ in the special case when $A = -B$. As…

Number Theory · Mathematics 2020-03-03 Xuancheng Shao , Max Wenqiang Xu

Gilmer has recently shown that in any nonempty union-closed family $\mathcal F$ of subsets of a finite set, there exists an element contained in at least a proportion $.01$ of the sets of $\mathcal F$. We improve the proportion from $.01$…

Combinatorics · Mathematics 2023-06-21 Will Sawin

We study the uniform query reliability problem, which asks, for a fixed Boolean query Q, given an instance I, how many subinstances of I satisfy Q. Equivalently, this is a restricted case of Boolean query evaluation on tuple-independent…

Databases · Computer Science 2023-01-18 Antoine Amarilli

We continue the investigation of problems concerning correlation clustering or clustering with qualitative information, which is a clustering formulation that has been studied recently. The basic setup here is that we are given as input a…

Data Structures and Algorithms · Computer Science 2007-05-23 Ioannis Giotis , Venkatesan Guruswami

We construct a microscopic model to study discrete randomness in bistable systems coupled to an environment comprising many degrees of freedom. A quartic double well is bilinearly coupled to a finite number $N$ of harmonic oscillators.…

Statistical Mechanics · Physics 2020-10-19 Thomas Dittrich , Santiago Peña Martínez

We study the robustness of approval-based participatory budgeting (PB) rules to random noise in the votes. Our contributions are twofold. First, we study the computational complexity of the #Flip-Bribery problem, where given a PB instance…

Computer Science and Game Theory · Computer Science 2023-05-16 Niclas Boehmer , Piotr Faliszewski , Łukasz Janeczko , Andrzej Kaczmarczyk

Stability Selection was recently introduced by Meinshausen and Buhlmann (2010) as a very general technique designed to improve the performance of a variable selection algorithm. It is based on aggregating the results of applying a selection…

Statistics Theory · Mathematics 2016-04-27 Rajen D. Shah , Richard J. Samworth