Related papers: Refining Concentration for Gaussian Quadratic Chao…
We study Gaussian concentration inequalities for random fields obtained as finitary codings of i.i.d.\ fields, linking concentration properties to coding structure. A finitary coding represents a dependent field as a shift-equivariant image…
We consider an ensemble of large non-Hermitian random matrices of the form $\hat{H}+i\hat{A}_s$, where $\hat{H}$ and $\hat{A}_s$ are Hermitian statistically independent random $N\times N$ matrices. We demonstrate the existence of a new…
This paper quantifies the intuitive observation that adding noise reduces available information by means of non-linear strong data processing inequalities. Consider the random variables $W\to X\to Y$ forming a Markov chain, where $Y=X+Z$…
Entropic uncertainty relations in a finite dimensional Hilbert space are investigated. Making use of the majorization technique we derive explicit lower bounds for the sum of R\'enyi entropies describing probability distributions associated…
Let $X$ be a compact complex, not necessarily K\"ahler, manifold of dimension $n$. We characterise the volume of any holomorphic line bundle $L\to X$ as the supremum of the Monge-Amp\`ere masses $\int_X T_{ac}^n$ over all closed positive…
We compute explicit bounds in the normal and chi-square approximations of multilinear homogenous sums (of arbitrary order) of general centered independent random variables with unit variance. In particular, we show that chaotic random…
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…
Full-waveform inversion (FWI) is known as a seismic data processing method that achieves high-resolution imaging. In the inversion part of the method that brings high resolution in finding a convergence point in the model space, a local…
Let $M$ be a random $m \times n$ matrix with binary entries and i.i.d. rows. The weight (i.e., number of ones) of a row has a specified probability distribution, with the row chosen uniformly at random given its weight. Let $N(n,m)$ denote…
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…
Light-front Hamiltonian formulation of QCD with only one flavor of quarks is used in its simplest approximate version to calculate masses and boost-invariant wave functions of c-anti-c or b-anti-b mesons. It is shown that in the Hamiltonian…
We consider a parametric quasi-variational inequality (QVI) without any convexity assumption. Using the concept of \emph{optimal value function}, we transform the problem into that of solving a nonsmooth system of inequalities. Based on…
In optimal control theory the expression infimum gap means a strictly negative difference between the infimum value of a given minimum problem and the infimum value of a new problem obtained by the former by extending the original family V…
We consider a linearised inverse conductivity problem for electromagnetic waves in a three dimensional bounded domain at a high time-harmonic frequency. Increasing stability bounds for the conductivity coefficient in the full Maxwell system…
We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with…
The experimental test of Bell's inequality is mainly focused on Clauser-Horne-Shimony-Holt (CHSH) form, which provides a quantitative bound, while little attention has been pained on the violation of Wigner inequality (WI). Based on the…
We study the fundamental limits for reconstruction in weighted graph (or matrix) database alignment. We consider a model of two graphs where $\pi^*$ is a planted uniform permutation and all pairs of edge weights $(A_{i,j},…
This work considers a discrete-time Poisson noise channel with an input amplitude constraint $\mathsf{A}$ and a dark current parameter $\lambda$. It is known that the capacity-achieving distribution for this channel is discrete with…
Semidefinite programs are optimization methods with a wide array of applications, such as approximating difficult combinatorial problems. One such semidefinite program is the Goemans-Williamson algorithm, a popular integer relaxation…
Homogeneous relaxation is a ubiquitous phenomenon in semiclassical kinetic theories where the quasiparticles are distributed uniformly in space, and the equilibration involves only their velocity distribution. For such solutions, the…