Related papers: Capacity lower bound for the Ising perceptron

For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…

The two-magnon-bound-state mass gap m_2 for the two-dimensional quantum Ising model was investigated by means of the numerical diagonalization method; the low-lying spectrum is directly accessible via the numerical diagonalization method.…

We address the problem of minimal actuator placement in linear systems so that the volume of the set of states reachable with one unit or less of input energy is lower bounded by a desired value. First, following the recent work of…

Almost four decades ago, Bergman and Milton independently showed that the isotropic effective electric permittivity of a two-phase composite material with a given volume fraction is constrained to lie within lens-shaped regions in the…

It has recently been shown that for compressive sensing, significantly fewer measurements may be required if the sparsity assumption is replaced by the assumption the unknown vector lies near the range of a suitably-chosen generative model.…

Let $N_n$ be an $n\times n$ complex random matrix, each of whose entries is an independent copy of a centered complex random variable $z$ with finite non-zero variance $\sigma^{2}$. The strong circular law, proved by Tao and Vu, states that…

We present a complementary methodology to constrain the total neutrino mass, $\sum m_{\nu}$, based on the diffusion coefficient of the splashback mass function of dark matter halos. Analyzing the snapshot data from the Massive Neutrino…

One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equal to $\frac43$. For 40 years, the best known upper bound…

The Nisan-Ronen conjecture states that no truthful mechanism for makespan-minimization when allocating $m$ tasks to $n$ unrelated machines can have approximation ratio less than $n$. Over more than two decades since its formulation, little…

The Ising limit of a conventional Hermitian parity-symmetric scalar quantum field theory is a correlated limit in which two bare Lagrangian parameters, the coupling constant $g$ and the {\it negative} mass squared $-m^2$, both approach…

We investigate the Trans-Planckian Censorship Conjecture (TCC) and the arising bounds on the inflationary cosmology caused by that conjecture. In that investigation, we analyze TCC bounds for both Jordan and Einstein frames in the presence…

Let $G$ be a group with a non-elementary action on a proper CAT(0) space $X$, and let $\mu$ be a measure on $G$ such that the random walk $(Z_n)_n$ generated by $\mu$ has finite second moment on $X$. Let $o$ be a basepoint in $X$, and…

We prove anti-concentration bounds for the inner product of two independent random vectors, and use these bounds to prove lower bounds in communication complexity. We show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot…

We show that in the point process limit of the bulk eigenvalues of $\beta$-ensembles of random matrices, the probability of having no eigenvalue in a fixed interval of size $\lambda$ is given by \[\bigl(\…

The spectral gap $\gamma$ of an ergodic and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to a fixed…

A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing…

Let $A$ be the adjacency matrix of a uniformly random $d$-regular digraph on $n$ vertices, and suppose that $\min(d,n-d)\geq\lambda n$. We show that for any $\kappa \geq 0$, \[\mathbb{P}[s_n(A)\leq\kappa]\leq…

We prove risk bounds for binary classification in high-dimensional settings when the sample size is allowed to be smaller than the dimensionality of the training set observations. In particular, we prove upper bounds for both 'compressive…

We study differentiability properties of a potential of the type $K\star \mu$, where $\mu$ is a finite Radon measure in $\mathbb{R}^N$ and the kernel $K$ satisfies $|\nabla^j K(x)| \le C\, |x|^{-(N-1+j)}, \quad j=0,1,2.$ We introduce a…

We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the…