English
Related papers

Related papers: Gowers Uniformity, Influence of Variables, and PCP…

200 papers

We define a class of groups equipped with an invariant probability measure, which includes all compact groups and is closed under taking ultraproducts with the induced Loeb measure; in fact, this class also contains the ultraproducts all…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

Gaussian universality results assert that the properties of many estimators remain unchanged when the input data are replaced by Gaussians. Such results have gained popularity in high-dimensional statistics and machine learning, as…

Probability · Mathematics 2025-12-03 Kevin Han Huang , Morgane Austern , Peter Orbanz

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

Numerical Analysis · Mathematics 2012-01-18 Massimo Fornasier , Karin Schnass , Jan Vybiral

We present new families of goodness-of-fit tests of uniformity on a full-dimensional set $W\subset\R^d$ based on statistics related to edge lengths of random geometric graphs. Asymptotic normality of these statistics is proven under the…

Statistics Theory · Mathematics 2020-07-20 Bruno Ebner , Franz Nestmann , Matthias Schulte

An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…

Combinatorics · Mathematics 2020-06-17 E. Aigner-Horev , D. Conlon , H. Hàn , Y. Person , M. Schacht

A set subset of Euclidean space whose indicator function has maximal Gowers norm, among all sets of equal measure, is an ellipsoid up to Lebesgue null sets. If the indicator function has nearly maximal Gowers norm then the set nearly…

Classical Analysis and ODEs · Mathematics 2015-12-11 Michael Christ

We prove new concentration estimates for random variables that are functionals of a Poisson measure defined on a general measure space. Our results are specifically adapted to geometric applications, and are based on a pervasive use of a…

Probability · Mathematics 2015-04-14 Sascha Bachmann , Giovanni Peccati

This work extends the Mond-Pecaric method to functions with multiple operators as arguments by providing arbitrarily close approximations of the original functions. Instead of using linear functions to establish lower and upper bounds for…

Functional Analysis · Mathematics 2024-07-09 Shih-Yu Chang

Sums of independent random variables form the basis of many fundamental theorems in probability theory and statistics, and therefore, are well understood. The related problem of characterizing products of independent random variables seems…

Probability · Mathematics 2018-05-29 Željka Stojanac , Daniel Suess , Martin Kliesch

Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…

Computational Complexity · Computer Science 2014-02-11 Yuichi Yoshida

We examine Fourier frames and, more generally, frame measures for different probability measures. We prove that if a measure has an associated frame measure, then it must have a certain uniformity in the sense that the weight is distributed…

Functional Analysis · Mathematics 2021-07-20 Dorin Ervin Dutkay , Chun-Kit Lai

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

Group Theory · Mathematics 2008-04-07 Kiran S. Kedlaya , Xuancheng Shao

We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…

Combinatorics · Mathematics 2012-03-13 Balazs Szegedy

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…

Combinatorics · Mathematics 2021-03-05 Ewan Davies , Matthew Jenssen , Will Perkins , Barnaby Roberts

Due to their flexibility, Gaussian processes (GPs) have been widely used in nonparametric function estimation. A prior information about the underlying function is often available. For instance, the physical system (computer model output)…

Methodology · Statistics 2017-11-21 Hassan Maatouk

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

Combinatorics · Mathematics 2013-08-27 Guy Moshkovitz , Asaf Shapira

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

Let $\Omega$ be a bounded pseudoconvex domain in $\mathbb{C}^N$. Given a continuous plurisubharmonic function $u$ on $\Omega$, we construct a sequence of Gaussian analytic functions $f_n$ on $\Omega$ associated with $u$ such that…

Complex Variables · Mathematics 2025-03-21 Kiyoon Eum

Under the assumption that the distribution of a nonnegative random variable $X$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to…

Probability · Mathematics 2014-07-15 Richard Arratia , Peter Baxendale

We study divisibility properties of a set $\{f_1(\mathbf{U}_n^{(s)}),\ldots,f_m(\mathbf{U}_n^{(s)})\}$, where $f_1,\ldots,f_m$ are polynomials in $s$ variables over $\mathbb{Z}$ and $\mathbf{U}_n^{(s)}$ is a point picked uniformly at random…

Number Theory · Mathematics 2023-11-10 Zakhar Kabluchko , Alexander Marynych