English
Related papers

Related papers: Exponential Squared Integrability for the Discrepa…

200 papers

For a pair of coupled rectangular random matrices we consider the squared singular values of their product, which form a determinantal point process. We show that the limiting mean distribution of these squared singular values is described…

Mathematical Physics · Physics 2020-06-24 Guilherme L. F. Silva , Lun Zhang

It is well-known that for every $N \geq 1$ and $d \geq 1$ there exist point sets $x_1, \dots, x_N \in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\log N)^{d-1} N^{-1}$. In a more general setting,…

Combinatorics · Mathematics 2017-03-20 Christoph Aistleitner , Dmitriy Bilyk , Aleksandar Nikolov

We revisit extending the Kolmogorov-Smirnov distance between probability distributions to the multidimensional setting and make new arguments about the proper way to approach this generalization. Our proposed formulation maximizes the…

Computation · Statistics 2025-04-16 Peter Matthew Jacobs , Foad Namjoo , Jeff M. Phillips

Let $S_n=\e_1+...+\e_n$, where $ \e_i $ are i.i.d. Bernoulli r.v.'s. Let $0\le r_d(n)<2d$ be the least residue of $n$ mod$(2d)$, $\bar r_d(n)= 2d -r_d(n)$ and $\b(n,d)=\max ({1\over d}, {1\over \sqrt n})[e^{- {r_d(n)^2/2 n}} +e^{- {\bar…

Number Theory · Mathematics 2009-08-17 Michel Weber

We extend the notion of combinatorial discrepancy to \emph{non-additive} functions. Our main result is an upper bound of $O(\sqrt{n \log(nk)})$ on the non-additive $k$-color discrepancy when $k$ is a prime power. We demonstrate two…

Computer Science and Game Theory · Computer Science 2025-09-23 Max Dupre la Tour , Kaito Fujii

Let $M^n$ be a complete noncompact K$\ddot{a}$hler manifold of complex dimension $n$ with nonnegative holomorphic bisectional curvature. Denote by $\mathcal{O}$$_d(M^n)$ the space of holomorphic functions of polynomial growth of degree at…

Differential Geometry · Mathematics 2007-05-23 Bing-Long Chen , Xiao-Yong Fu , Le Yin , Xi-Ping Zhu

Metric embeddings are a widely used method in algorithm design, where generally a ``complex'' metric is embedded into a simpler, lower-dimensional one. Historically, the theoretical computer science community has focused on bi-Lipschitz…

Data Structures and Algorithms · Computer Science 2025-05-19 Ainesh Bakshi , Vincent Cohen-Addad , Samuel B. Hopkins , Rajesh Jayaram , Silvio Lattanzi

We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant…

Machine Learning · Computer Science 2026-05-26 Nadav Dym , Matthias Wellershoff , Efstratios Tsoukanis , Daniel Levy , Radu Balan

The 1/N expansion of the two-particle irreducible (2PI) effective action is employed to compute universal properties at the second-order phase transition of an O(N)-symmetric N-vector model directly in three dimensions. At next-to-leading…

High Energy Physics - Phenomenology · Physics 2010-02-04 M. Alford , J. Berges , J. M. Cheyne

In this paper we study the geometric discrepancy of explicit constructions of uniformly distributed points on the two-dimensional unit sphere. We show that the spherical cap discrepancy of random point sets, of spherical digital nets and of…

Numerical Analysis · Mathematics 2014-02-17 Christoph Aistleitner , Johann Brauchart , Josef Dick

In this article we derive moment estimates, exponential integrability, concentration inequalities and exit times estimates for canonical diffusions in two settings each beyond the scope of Riemannian geometry. Firstly, we consider…

Probability · Mathematics 2020-02-24 Anton Thalmaier , James Thompson

We introduce two convergent series expansions (direct and recursive) in terms of Bessel functions and representations of sums $r_N(m)$ of squares for $N$-dimensional Madelung constants, $M_N(s)$, where $s$ is the exponent of the Madelung…

Mathematical Physics · Physics 2022-12-14 Antony Burrows , Shaun Cooper , Peter Schwerdtfeger

We study the problem of robustly estimating the mean of a $d$-dimensional distribution given $N$ examples, where most coordinates of every example may be missing and $\varepsilon N$ examples may be arbitrarily corrupted. Assuming each…

Data Structures and Algorithms · Computer Science 2021-05-04 Lunjia Hu , Omer Reingold

We propose a "decomposition method" to prove non-asymptotic bound for the convergence of empirical measures in various dual norms. The main point is to show that if one measures convergence in duality with sufficiently regular observables,…

Probability · Mathematics 2018-02-13 Benoît Kloeckner

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…

Numerical Analysis · Mathematics 2023-07-25 Yohei M. Koyama

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

Computational Geometry · Computer Science 2017-11-16 Jakub Sosnovec

We consider an $O(N)$ scalar field model with quartic interaction in $d$-dimensional Euclidean de Sitter space. In order to avoid the problems of the standard perturbative calculations for light and massless fields, we generalize to the…

High Energy Physics - Theory · Physics 2016-09-22 Diana López Nacir , Francisco D. Mazzitelli , Leonardo G. Trombetta

This article proposes a new way of deriving mean-field exponents for sufficiently spread-out Bernoulli percolation in dimensions $d>6$. We obtain an upper bound for the full-space and half-space two-point functions in the critical and…

Probability · Mathematics 2025-07-28 Hugo Duminil-Copin , Romain Panis

We obtain estimates for the number $p_d(n)$ of $(d-1)$-dimensional integer partitions of a number $n$. It is known that the two-sided inequality $C_1(d)n^{1-1/d}<\log p_d(n)< C_2(d)n^{1-1/d}$ is always true and that $C_1(d)>1$ whenever…

Combinatorics · Mathematics 2024-05-14 Kristina Oganesyan

For a small disk D centered at the origin in R^2, a smooth real-valued function S(x,y) on D, and a positive epsilon, we consider the measure of the points in D where |S(x,y)| < epsilon, as well as oscillatory integral analogues.…

Classical Analysis and ODEs · Mathematics 2009-06-10 Michael Greenblatt
‹ Prev 1 3 4 5 6 7 10 Next ›