English
Related papers

Related papers: Capacity lower bound for the Ising perceptron

200 papers

In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…

Analysis of PDEs · Mathematics 2013-02-18 Arkady Poliakovsky

We consider an optimal transport problem with backward martingale constraint. The objective function is given by the scalar product of a pseudo-Euclidean space $S$. We show that the supremums over maps and plans coincide, provided that the…

Probability · Mathematics 2024-05-30 Dmitry Kramkov , Mihai Sîrbu

For $N$-point best-packing configurations $\omega_N$ on a compact metric space $(A,\rho)$, we obtain estimates for the mesh-separation ratio $\gamma(\omega_N,A)$, which is the quotient of the covering radius of $\omega_N$ relative to $A$…

Mathematical Physics · Physics 2012-12-27 A. V. Bondarenko , D. P. Hardin , E. B. Saff

The advent of large-scale inference has spurred reexamination of conventional statistical thinking. In a Gaussian model for $n$ many $z$-scores with at most $k < \frac{n}{2}$ nonnulls, Efron suggests estimating the location and scale…

Statistics Theory · Mathematics 2025-01-15 Subhodh Kotekal , Chao Gao

This paper derives fundamental limits on the performance of compressive classification when the source is a mixture of Gaussians. It provides an asymptotic analysis of a Bhattacharya based upper bound on the misclassification probability…

Information Theory · Computer Science 2014-01-28 Hugo Reboredo , Francesco Renna , Robert Calderbank , Miguel R. D. Rodrigues

The threshold behaviour of negative eigenvalues for Schr\"{o}dinger operators of the type $$ H_\lambda=-\frac{d^2}{dx^2}+U(x)+\lambda\alpha_\lambda V(\alpha_\lambda x) $$ is considered. The potentials $U$ and $V$ are real-valued bounded…

Spectral Theory · Mathematics 2021-12-14 Yuriy Golovaty

We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular dictionary compressors. To achieve this result we combine several recent findings,…

Data Structures and Algorithms · Computer Science 2019-09-06 Anders Roy Christiansen , Mikko Berggren Ettienne , Tomasz Kociumaka , Gonzalo Navarro , Nicola Prezza

"Bounds on information combining" are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in…

Quantum Physics · Physics 2019-08-27 Christoph Hirche , David Reeb

The capacity of a discrete-time model of optical fiber described by the split-step Fourier method (SSFM) as a function of the signal-to-noise ratio $\text{SNR}$ and the number of segments in distance $K$ is considered. It is shown that if…

Information Theory · Computer Science 2021-09-28 Milad Sefidgaran , Mansoor Yousefi

We show that in a general \cal{N} = 1 supergravity with N \gg 1 scalar fields, an exponentially small fraction of the de Sitter critical points are metastable vacua. Taking the superpotential and Kahler potential to be random functions, we…

High Energy Physics - Theory · Physics 2015-06-03 David Marsh , Liam McAllister , Timm Wrase

We call a positive real number $\lambda$ admissible if it belongs to the Lagrange spectrum and there exists an irrational number $\alpha$ such that $\mu(\alpha)=\lambda$. Here $\mu(\alpha)$ denotes the Lagrange constant of $\alpha$ -…

Number Theory · Mathematics 2018-08-22 Dmitry Gayfulin

We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…

Combinatorics · Mathematics 2022-09-23 Leonid Gurvits , Jonathan Leake

We provide an isoperimetric comparison theorem for small volumes in an $n$-dimensional Riemannian manifold $(M^n,g)$ with strong bounded geometry, as in Definition $2.3$, involving the scalar curvature function. Namely in strong bounded…

Differential Geometry · Mathematics 2020-07-16 Stefano Nardulli , Luis Eduardo Osorio Acevedo

The $f(T)$ theory, which is an extension of teleparallel, or torsion scalar $T$, gravity, is recently proposed to explain the present cosmic accelerating expansion with no need of dark energy. In this Letter, we first perform the…

General Relativity and Quantum Cosmology · Physics 2010-10-12 Puxun Wu , Hongwei Yu

In this work we connect two notions: That of the nonparametric mode of a probability measure, defined by asymptotic small ball probabilities, and that of the Onsager-Machlup functional, a generalized density also defined via asymptotic…

Statistics Theory · Mathematics 2024-04-09 Remo Kretschmann

We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly…

Information Theory · Computer Science 2023-10-30 Jennifer Tang , Yury Polyanskiy

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

Functional Analysis · Mathematics 2022-07-13 Daniel Bartl , Shahar Mendelson

Let $\Gamma$ be an $n\times m$ matrix with independent standard Gaussian entries and let $G_m = \Gamma(B_1^m)$ be the associated Gaussian Gluskin polytope (equivalently, a random $n$-dimensional quotient of $\ell_1^m$). In the regime $m =…

Functional Analysis · Mathematics 2026-02-12 Omer Friedland

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

By the seminal paper of Claude Shannon \cite{Shannon48}, the computation of the capacity of a discrete memoryless channel has been considered as one of the most important and fundamental problems in Information Theory. Nearly 50 years ago,…

Information Theory · Computer Science 2025-07-22 Michail Fasoulakis , Konstantinos Varsos , Apostolos Traganitis
‹ Prev 1 8 9 10 Next ›