Related papers: Capacity lower bound for the Ising perceptron

We establish sharp stability results for of non--selfadjoint the ascent and descent spectra under strong resolvent convergence (SRS), a natural framework for finite element approximations of non-selfadjoint and singularly perturbed…

We derive improved and easily computable upper bounds on the capacity of the discrete-time Poisson channel under an average-power constraint and an arbitrary constant dark current term. This is accomplished by combining a general convex…

In part II we constructed the lower bound, in the spirit of $\Gamma$- $\liminf$ for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking the form E_\e(v):=\int_\Omega…

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian, denoted by $\lambda_r(m)$, among all $r$-uniform hypergraphs of fixed size $m$ is achieved by the minimum hypergraph $C_{r,m}$ under the colexicographic order. We say $m$…

Let $\Gamma$ be a discrete countable group acting isometrically on a measurable field $\mathbf{X}$ of CAT(0)-spaces of finite telescopic dimension over some ergodic standard Borel probability $\Gamma$-space $(\Omega,\mu)$. If $\mathbf{X}$…

A simple model to study subspace clustering is the high-dimensional $k$-Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction…

In [Sau11,SPW13], Saunderson, Parrilo and Willsky asked the following elegant geometric question: what is the largest $m= m(d)$ such that there is an ellipsoid in $\mathbb{R}^d$ that passes through $v_1, v_2, \ldots, v_m$ with high…

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…

The capacity of a graph is defined as the rate of exponential grow of independent sets in the strong powers of the graph. In strong power, an edge connects two sequences if at each position letters are equal or adjacent. We consider a…

Sparse superposition codes, also called sparse regression codes (SPARCs), are a class of codes for efficient communication over the AWGN channel at rates approaching the channel capacity. In a standard SPARC, codewords are sparse linear…

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

We establish the classical capacity of optical quantum channels as a sharp transition between two regimes---one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly…

We examine codes, over the additive Gaussian noise channel, designed for reliable communication at some specific signal-to-noise ratio (SNR) and constrained by the permitted minimum mean-square error (MMSE) at lower SNRs. The maximum…

Asymptotic expressions of the mutual information between any discrete input and the corresponding output of the scalar additive white Gaussian noise channel are presented in the limit as the signal-to-noise ratio (SNR) tends to infinity.…

In a seminal paper, Kannan and Lov\'asz (1988) considered a quantity $\mu_{KL}(\Lambda,K)$ which denotes the best volume-based lower bound on the covering radius $\mu(\Lambda,K)$ of a convex body $K$ with respect to a lattice $\Lambda$.…

Let $y$ be a random vector in \rn, satisfying $$ \Bbb E \, \tens{y} = id. $$ Let $M$ be a natural number and let $y_1 \etc y_M$ be independent copies of $y$. We prove that for some absolute constant $C$ $$ \enor{\frac{1}{M} \sum_i…

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…

We theoretically investigate the phase sensitivity with parity detection on a Mach-Zehnder interferometer with a coherent state combined with a photon-added squeezed vacuum state. When the phase shift approaches zero, the squeezed vacuum…

Systems close to a phase transition turn weak perturbations into large responses. At equilibrium, this amplification is closely linked to criticality: fluctuations grow, dynamics slow, and a common soft mode controls the response. Whether…

Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from $\{-1,+1\}^n$ and define \[ M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. \] It is proved that $M(A_n)/\sqrt{n\log n}$ converges in…