Related papers: Euclidean Partitions Optimizing Noise Stability
We propose a new approach to study plethysm coefficients by using the Schur-Weyl duality between the symmetric group and the partition algebra. This allows us to explain the stability properties of plethysm and Kronecker coefficients in a…
The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…
The Gaussian noise stability of a function $f:\mathbb{R}^n \to \{-1, 1\}$ is the expected value of $f(\boldsymbol{x}) \cdot f(\boldsymbol{y})$ over $\rho$-correlated Gaussian random variables $\boldsymbol{x}$ and $\boldsymbol{y}$. Borell's…
An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random…
In this paper, we study a class of slow-fast stochastic partial differential equations with multiplicative Wiener noise. Under some appropriate conditions, we prove the slow component converges to the solution of the corresponding averaged…
We proposed a new criterion \textit{noise-stability}, which revised the classical rigidity theory, for evaluation of MDS algorithms which can truthfully represent the fidelity of global structure reconstruction; then we proved the…
The deterministic inviscid primitive equations (also called the hydrostatic Euler equations) are known to be ill-posed in Sobolev spaces and in Gevrey classes of order strictly greater than 1, and some of their analytic solutions exist only…
Verifying the performance of safety-critical, stochastic systems with complex noise distributions is difficult. We introduce a general procedure for the finite abstraction of nonlinear stochastic systems with non-standard (e.g., non-affine,…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…
We consider minimax signal detection in the sequence model. Working with certain ellipsoids in the space of square-summable sequences of real numbers, with a ball of positive radius removed, we obtain upper and lower bounds for the minimax…
The over-damped motion of a Brownian particle in an asymmetric, bistable, fluctuating potential shows noise induced stability: For intermediate fluctuation rates the mean occupancy of minima with an energy above the absolute minimum is…
Classical jittered sampling partitions $[0,1]^d$ into $m^d$ cubes for a positive integer $m$ and randomly places a point inside each of them, providing a point set of size $N=m^d$ with small discrepancy. The aim of this note is to provide a…
We study the isentropic compressible Euler equations in multi-dimensions with stochastic perturbation of transport type. On the one hand, this is motivated by the physical modelling in turbulence theory. On the other hand, it has been shown…
This paper studies Langevin equation with random damping due to multiplicative noise and its solution. Two types of multiplicative noise, namely the dichotomous noise and fractional Gaussian noise are considered. Their solutions are…
The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows,…
Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y for a given y. In general, whenever the…
The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…
A major research area in discrete geometry is to consider the best way to partition the $d$-dimensional Euclidean space $\mathbb{R}^d$ under various quality criteria. In this paper we introduce a new type of space partitioning that is…
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…
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…