Related papers: Gaps between logs
We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…
In this paper, we give estimates of the minimal ${\mathbb{L}}^1$ distance between the distribution of the normalized partial sum and the limiting Gaussian distribution for stationary sequences satisfying projective criteria in the style of…
We consider a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…
We consider quadratic Weyl sums $S_N(x;c,\alpha)=\sum_{n=1}^N\exp\{2\pi i((\frac{1}{2}n^2+cn)x+\alpha n)\}$ for $c=\alpha=0$ (the rational case) or $(c,\alpha)\notin\mathbb{Q}^2$ (the irrational case), where $x$ is randomly distributed…
This paper builds on the notion of the so-called orthogonal derivative, where an n-th order derivative is approximated by an integral involving an orthogonal polynomial of degree n. This notion was reviewed in great detail in a paper in J.…
Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…
For a $d$-dimensional log-concave distribution $\pi(\theta) \propto e^{-f(\theta)}$ constrained to a convex body $K$, the problem of outputting samples from a distribution $\nu$ which is $\varepsilon$-close in infinity-distance…
In this paper, we use the Bessel $\delta$-method, along with new variants of the van der Corput method in two dimensions, to prove non-trivial bounds for $\mathrm{GL}(2)$ exponential sums beyond the Weyl barrier. More explicitly, for sums…
The Gromov-Wasserstein (GW) distance enables comparing metric measure spaces based solely on their internal structure, making it invariant to isomorphic transformations. This property is particularly useful for comparing datasets that…
We study exponential sums of the form $\sum_{n=1}^N e^{2\pi i a b^n/m}$ for non-zero integers $a,b,m$. Classically, non-trivial bounds were known for $N\ge \sqrt{m}$ by Korobov, and this range has been extended significantly by Bourgain as…
We prove Wasserstein contraction of simple slice sampling for approximate sampling w.r.t. distributions with log-concave and rotational invariant Lebesgue densities. This yields, in particular, an explicit quantitative lower bound of the…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
General Berry-Esseen bounds are developed for the exponential distribution using Stein's method. As an application, a sharp error term is obtained for Hora's result that the spectrum of the Bernoulli-Laplace Markov chain has an exponential…
We establish new quantitative estimates for general systems of functions with wavelet-type dyadic structure. These estimates are applied to obtain the optimal growth of various types of Weyl multipliers for certain wavelet-type systems.…
An integer partition is called graphical if it is the degree sequence of a simple graph. We prove that the probability that a uniformly chosen partition of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a…
We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our…
The Welschinger numbers, a kind of a real analog of the Gromov-Witten numbers which count the complex rational curves through a given generic collection of points, bound from below the number of real rational curves for any real generic…
We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size.…
We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the…
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of…