Related papers: Capacity lower bound for the Ising perceptron

Our main result marks progress on an old conjecture of Vitushkin. We show that a compact set in the plane with plenty of big projections (PBP) has positive analytic capacity, along with a quantitative lower bound. A higher dimensional…

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…

We introduce, and numerically study, a system of $N$ symplectically and globally coupled standard maps localized in a $d=1$ lattice array. The global coupling is modulated through a factor $r^{-\alpha}$, being $r$ the distance between maps.…

Basing on recently developed convex programming framework in the paper [arXiv:2204.10626], we provide a proof for a long-standing conjecture on optimality of Gaussian encondings for the ultimate communication rate of generalized heterodyne…

We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…

In this paper, we study the Onsager-Machlup function and its relationship to the Freidlin-Wentzell function for measures equivalent to arbitrary infinite dimensional Gaussian measures. The Onsager-Machlup function can serve as a density on…

We establish sharp non-asymptotic probabilistic bounds for the star discrepancy of double-infinite random matrices -- a canonical model for sequences of random point sets in high dimensions. By integrating the recently proved…

We present here the effective theory of inflation `a la Ginsburg-Landau in which the inflaton potential is a polynomial. The slow-roll expansion becomes a systematic 1/N expansion where N ~ 60. The spectral index and the ratio of…

We study the spectral gap of subgraphs of the hypercube induced by monotone subsets of vertices. For a monotone subset $A\subseteq\{0,1\}^{n}$ of density $\mu(A)$, the previous best lower bound on the spectral gap, due to Cohen, was…

The problem of imaging point objects can be formulated as estimation of an unknown atomic measure from its $M+1$ consecutive noisy Fourier coefficients. The standard resolution of this inverse problem is $1/M$ and super-resolution refers to…

We study the random binary symmetric perceptron problem, focusing on the behavior of rare high-margin solutions. While most solutions are isolated, we demonstrate that these rare solutions are part of clusters of extensive entropy,…

The interplay between disorder, quantum fluctuations and dissipation is studied in the random transverse Ising chain coupled to a dissipative Ohmic bath with a real space renormalization group. A typically very large length scale, L*, is…

Let $\Omega\subset\mathbb{R}^\nu$, $\nu\ge 2$, be a $C^{1,1}$ domain whose boundary $\partial\Omega$ is either compact or behaves suitably at infinity. For $p\in(1,\infty)$ and $\alpha>0$, define \[…

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

A classical problem in digital communications is to evaluate the symbol error probability (SEP) and bit error probability (BEP) of a multidimensional constellation over an additive white Gaussian noise channel. In this paper, we revisit…

Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the smallest singular value $s_n(Q_n)$ of $Q_n$ satisfies \[ \mathbb{P}\Big\{s_n(Q_n)\le…

Consider the uniform random graph $G(n,M)$ with $n$ vertices and $M$ edges. Erd\H{o}s and R\'enyi (1960) conjectured that the limit $$ \lim_{n \to \infty} \Pr\{G(n,\textstyle{n\over 2}) is planar}} $$ exists and is a constant strictly…

This paper investigates symbol detection for single-carrier communication systems operating in the presence of additive interference with Nakagami-m statistics. Such interference departs from the assumptions underlying conventional…

Let $\Omega\subset\mathbb{R}^{n+1}$, $n\ge 2$, be a 1-sided non-tangentially accessible domain (aka uniform domain), that is, $\Omega$ satisfies the interior Corkscrew and Harnack chain conditions, which are respectively…

We study the capacity of the power-constrained additive Gaussian channel with an entropy constraint at the input. In particular, we characterize this capacity in the low signal-to-noise ratio regime at small entropy. This follows as a…