Related papers: Capacity threshold for the Ising perceptron

We consider the Ising perceptron with gaussian disorder, which is equivalent to the discrete cube $\{-1,+1\}^N$ intersected by $M$ random half-spaces. The perceptron's capacity is $\alpha_N \equiv M_N/N$ for the largest integer $M_N$ such…

Determining the capacity $\alpha_c$ of the Binary Perceptron is a long-standing problem. Krauth and Mezard (1989) conjectured an explicit value of $\alpha_c$, approximately equal to .833, and a rigorous lower bound matching this prediction…

We study the statistical capacity of the classical binary perceptrons with general thresholds $\kappa$. After recognizing the connection between the capacity and the bilinearly indexed (bli) random processes, we utilize a recent progress in…

We consider the Ising perceptron model with N spins and M = N*alpha patterns, with a general activation function U that is bounded above. For U bounded away from zero, or U a one-sided threshold function, it was shown by Talagrand (2000,…

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…

We introduce a notion of capacity for high dimensional critical percolation by showing that for any finite set $A$, the suitably rescaled probability that the cluster of $z$ intersects $A$ converges as $\|z\|\to\infty$. This can be viewed…

Let $C(d)$ be the capacity of the binary deletion channel with deletion probability $d$. It was proved by Drinea and Mitzenmacher that, for all $d$, $C(d)/(1-d)\geq 0.1185 $. Fertonani and Duman recently showed that $\limsup_{d\to…

We study the replica-symmetric saddle point equations for the Ising perceptron with Gaussian disorder and margin $\kappa\ge 0$. We prove that for each $\kappa\ge 0$ there is a critical capacity $\alpha_c(\kappa)=\frac{2}{\pi\,\mathbb…

We study the problem of determining the capacity of the binary perceptron for two variants of the problem where the corresponding constraint is symmetric. We call these variants the rectangle-binary-perceptron (RPB) and the…

We prove, under an assumption on the critical points of a real-valued function, that the symmetric Ising perceptron exhibits the `frozen 1-RSB' structure conjectured by Krauth and Mezard in the physics literature; that is, typical solutions…

The logarithmic capacity (also called Chebyshev constant or transfinite diameter) of two real intervals $[-1,\alpha]\cup[\beta,1]$ has been given explicitly with the help of Jacobi's elliptic and theta functions already by Achieser in 1930.…

Let $(M,\omega)$ be an aspherical symplectic manifold, which is closed or convex. Let $U$ be an open set in $M$, which admits a circle action generated by an autonomous Hamiltonian $H \in C^\infty(U)$, such that each orbit of the circle…

By analogy with conjectures for random matrices, Fyodorov-Hiary-Keating and Fyodorov-Keating proposed precise asymptotics for the maximum of the Riemann zeta function in a typical short interval on the critical line. In this paper, we…

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…

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…

Consider the discrete maximal function acting on $\ell^2(\mathbb Z)$ functions \[ \mathcal{C}_{\Lambda} f( n ) := \sup_{ \lambda \in \Lambda} \left| \sum_{m \neq 0} f(n-m) \frac{e^{2 \pi i\lambda m^2}} {m} \right| \] where $\Lambda \subset…

We consider the Ising model on a general tree under various boundary conditions: all plus, free and spin-glass. In each case, we determine when the root is influenced by the boundary values in the limit as the boundary recedes to infinity.…

We prove the leading order of a conjecture by Fyodorov, Hiary and Keating, about the maximum of the Riemann zeta function on random intervals along the critical line. More precisely, as $T \rightarrow \infty$ for a set of $t \in [T, 2T]$ of…

Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the channel graph, and they conjectured equality. Here we derive an upper bound that proves the…

We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing the notion of independence entropy, originally studied in the…