English
Related papers

Related papers: Chernoff Bounds and Reverse Hypercontractivity on …

200 papers

Compressed Sensing decoding algorithms can efficiently recover an N dimensional real-valued vector x to within a factor of its best k-term approximation by taking m = 2klog(N/k) measurements y = Phi x. If the sparsity or approximate…

Numerical Analysis · Mathematics 2008-12-09 Rachel Ward

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…

Optimization and Control · Mathematics 2020-01-30 Coralia Cartis , Nick Gould , Philippe L. Toint

We study sharpened forms of the concentration of measure phenomenon typically centered at stochastic expansions of order $d-1$ for any $d \in \mathbb{N}$. The bounds are based on $d$-th order derivatives or difference operators. In…

Probability · Mathematics 2018-08-14 Sergey G. Bobkov , Friedrich Götze , Holger Sambale

We study integration and $L^2$-approximation of functions of infinitely many variables in the following setting: The underlying function space is the countably infinite tensor product of univariate Hermite spaces and the probability measure…

Numerical Analysis · Mathematics 2026-01-13 Michael Gnewuch , Aicke Hinrichs , Klaus Ritter , Robin Rüßmann

We study high-dimensional Laplace-type integrals $I(\lambda):=(\lambda/2\pi)^{d/2}\int_{\mathbb R^d} g(x)e^{-\lambda f(x)}dx$ in the regime where both $d$ and $\lambda$ are large. Existing rigorous Laplace-expansion results in growing…

Classical Analysis and ODEs · Mathematics 2026-03-13 Alexander Katsevich , Anya Katsevich

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…

Probability · Mathematics 2022-01-06 Anup Rao , Amir Yehudayoff

Let $X_1,\dots,X_n$ be independent centered random vectors in $\mathbb{R}^d$. This paper shows that, even when $d$ may grow with $n$, the probability $P(n^{-1/2}\sum_{i=1}^nX_i\in A)$ can be approximated by its Gaussian analog uniformly in…

Statistics Theory · Mathematics 2022-03-08 Yuta Koike

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

Computational Complexity · Computer Science 2019-08-08 Aleksandrs Belovs , Eric Blais , Abhinav Bommireddi

In this article, we propose some two-sample tests based on ball divergence and investigate their high dimensional behavior. First, we study their behavior for High Dimension, Low Sample Size (HDLSS) data, and under appropriate regularity…

Statistics Theory · Mathematics 2024-10-08 Bilol Banerjee , Anil K. Ghosh

We construct a nonlocal density functional approximation with full exact exchange, while preserving the constraint-satisfaction approach and justified error cancellations of simpler semilocal functionals. This is achieved by interpolating…

Chemical Physics · Physics 2009-11-13 John P. Perdew , Viktor N. Staroverov , Jianmin Tao , Gustavo E. Scuseria

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

Classical Analysis and ODEs · Mathematics 2014-09-23 Michael Hochman

Let $n\geq 1$, $K>0$, and let $X=(X_1,X_2,\dots,X_n)$ be a random vector in $\mathbb{R}^n$ with independent $K$--subgaussian components. We show that for every $1$--Lipschitz convex function $f$ in $\mathbb{R}^n$ (the Lipschitzness with…

Probability · Mathematics 2023-05-02 Han Huang , Konstantin Tikhomirov

We study numerical integration of functions depending on an infinite number of variables. We provide lower error bounds for general deterministic linear algorithms and provide matching upper error bounds with the help of suitable multilevel…

Numerical Analysis · Mathematics 2021-02-09 Josef Dick , Michael Gnewuch

It is shown that, given a point $x\in\mathbbm{R}^d$, $d\ge 2$, and open sets $U_1,...,U_k$ containing $x$, any convex combination of the harmonic measures for $x$ with respect to $U_n$, $1\le n\le k$, is the limit of a sequence of harmonic…

Analysis of PDEs · Mathematics 2007-05-23 Wolfhard Hansen , Ivan Netuka

In this paper we study a sharp Hardy-Littlewood-Sobolev (HLS) type inequality with Riesz potential on bounded smooth domains. We obtain the inequality for a general bounded domain $\Omega$ and show that if the extension constant for…

Analysis of PDEs · Mathematics 2017-09-13 Mathew Gluck , Meijun Zhu

We consider an abundant class of non-uniformly hyperbolic $C^2$-H\'enon like diffeomorphisms called strongly regular and which corresponds to Benedicks-Carleson parameters. We prove the existence of $m>0$ such that for any such…

Dynamical Systems · Mathematics 2016-04-15 Pierre Berger

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

Computational Complexity · Computer Science 2025-12-09 Sreejata Kishor Bhattacharya , Arkadev Chattopadhyay

We prove a dispersive estimate for the evolution of Schroedinger operators H = -\Delta + V(x) in three dimensions. The potential should belong to the closure of bounded compactly-supported functions with respect to the golbal Kato norm.…

Analysis of PDEs · Mathematics 2016-08-31 Marius Beceanu , Michael Goldberg

Let $X$ be a convex cocompact hyperbolic surface, and let $\delta$ denote the Hausdorff dimension of its limit set. Let $N_X(\sigma,T)$ denote the number of resonances of $X$ inside the box $[\sigma, \delta] + i[0,T]$. We prove that for all…

Spectral Theory · Mathematics 2025-08-15 Louis Soares

Let $(X,\mu)$ be a standard probability space. An automorphism $T$ of $(X,\mu)$ has the weak Pinsker property if for every $\varepsilon > 0$ it has a splitting into a direct product of a Bernoulli shift and an automorphism of entropy less…

Dynamical Systems · Mathematics 2018-02-19 Tim Austin