Related papers: Virial Expansion Bounds

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

We consider the large deviations at the order of the variance for the central value of a family of $L$-functions among the members with bounded discriminant. When there is an upper bound on an integer moment of the central value twisted by…

In 2011 Musiker, Schiffler and Williams obtained expansion formulae for cluster algebras from orientable surfaces. For singly and doubly notched arcs these formulae required the notion of $\gamma$-symmetric perfect matchings and…

In this paper we provide a complete proof for a bound on the growth of multi-recurrences which are defined over a number field. The proven bound was already stated by van der Poorten and Schlickewei forty years ago.

For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This…

Lipschitz constants are connected to many properties of neural networks, such as robustness, fairness, and generalization. Existing methods for computing Lipschitz constants either produce relatively loose upper bounds or are limited to…

This paper extends the standard chaining technique to prove excess risk upper bounds for empirical risk minimization with random design settings even if the magnitude of the noise and the estimates is unbounded. The bound applies to many…

We introduce a new type of cluster expansion which generalizes a previous formula of Brydges and Kennedy. The method is especially suited for performing a phase-space multiscale expansion in a just renormalizable theory, and allows the…

Variational inference has become an increasingly attractive fast alternative to Markov chain Monte Carlo methods for approximate Bayesian inference. However, a major obstacle to the widespread use of variational methods is the lack of…

This paper presents significant advancements in tensor analysis and the study of random walks on manifolds. It introduces new tensor inequalities derived using the Mond-Pecaric method, which enriches the existing mathematical tools for…

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

We develop a local theory of lacunary Dirichlet series of the form $\sum\limits_{k=1}^{\infty}c_k\exp(-zg(k)), \Re(z)>0$ as $z$ approaches the boundary $i\RR$, under the assumption $g'\to\infty$ and further assumptions on $c_k$. These…

Two of the most popular parallel-in-time methods are Parareal and multigrid-reduction-in-time (MGRIT). Recently, a general convergence theory was developed in Southworth (2019) for linear two-level MGRIT/Parareal that provides necessary and…

We obtain explicit bounds on the truncation error of the cumulant series of a bounded complex function of a random vector with independent components. The bounds are based on multidimensional differences. This extends the theory of the…

We establish exponential bounds for the hypergeometric distribution which include a finite sampling correction factor, but are otherwise analogous to bounds for the binomial distribution due to Le\'on and Perron (2003) and Talagrand (1994).…

In this paper we analyze the approximation of multivariate integrals over the Euclidean plane for functions which are analytic. We show explicit upper bounds which attain the exponential rate of convergence. We use an infinite grid with…

The approach used by Kalashnikov and Tsitsiashvili for constructing upper bounds for the tail distribution of a geometric sum with subexponential summands is reconsidered. By expressing the problem in a more probabilistic light, several…

We present a new algorithm for improving lower bounds on $ex(n;\{C_3,C_4\})$, the maximum size (number of edges) of an $n$-vertex graph of girth at least 5. The core of our algorithm is a variant of a hill-climbing heuristic introduced by…

We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…

This work prepares new probability bounds for sums of random, independent, Hermitian tensors. These probability bounds characterize large-deviation behavior of the extreme eigenvalue of the sums of random tensors. We extend Lapalace…