Related papers: Sharp polynomial estimates for the decay of correl…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

Linked-twist maps are area-preserving, piece-wise diffeomorphisms, defined on a subset of the torus. They are non-uniformly hyperbolic generalisations of the well-known Arnold Cat Map. We show that a class of canonical examples have…

We consider maximization of stochastic monotone continuous submodular functions (CSF) with a diminishing return property. Existing algorithms only guarantee the performance \textit{in expectation}, and do not bound the probability of…

We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…

We consider distributed convex optimization problems that involve a separable objective function and nontrivial functional constraints, such as Linear Matrix Inequalities (LMIs). We propose a decentralized and computationally inexpensive…

For a certain parametrized family of maps on the circle, with critical points and logarithmic singularities where derivatives blow up to infinity, a positive measure set of parameters was constructed in [19], corresponding to maps which…

Absence of (complex) zeros property is at the heart of the interpolation method developed by Barvinok \cite{barvinok2017combinatorics} for designing deterministic approximation algorithms for various graph counting and computing partition…

We investigate the rate of convergence in the central limit theorem for convex sets. We obtain bounds with a power-law dependence on the dimension. These bounds are asymptotically better than the logarithmic estimates which follow from the…

In this paper, we focus on studying central limit theorems for functionals of some specific stationary random processes. In classical probability theory, it is well-known that for non-linear functionals of stationary Gaussian sequences, we…

Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

For Young systems, i.e. for hyperbolic systems without/with singularities satisfying Lai-Sang Young's axioms (which imply exponential decay of correlation and the CLT) a local CLT is proven. In fact, a unified version of the local CLT is…

We prove that every geometric Lorenz attractor has superpolynomial decay of correlations with respect to the unique SRB measure. Moreover, we prove the Central Limit Theorem and Almost Sure Invariance Principle for the time-1 map of the…

We give the first deterministic fully polynomial-time approximation scheme (FPTAS) for computing the partition function of a two-state spin system on an arbitrary graph, when the parameters of the system satisfy the uniqueness condition on…

Let $Q$ be a transition probability on a measurable space $E$, let $(X\_n)\_n$ be a Markov chain associated to $Q$, and let $\xi$ be a real-valued measurable function on $E$, and $S\_n = \sum\_{k=1}^{n} \xi(X\_k)$. Under functional…

Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…

We prove exponential estimates for plurisubharmonic functions with respect to Monge-Ampere measures with Holder continuous potential. As an application, we obtain several stochastic properties for the equilibrium measures associated to…

For a polynomial $P$ mapping the integers into the integers, define an averaging operator $A_{N} f(x):=\frac{1}{N}\sum_{k=1}^N f(x+P(k))$ acting on functions on the integers. We prove sufficient conditions for the $\ell^{p}$-improving…

We study $L^p$ boundedness of the maximal average over dilations of a smooth hypersurface $S$. When the decay rate of the Fourier transform of a measure on $S$ is $1/2$, we establish the optimal maximal bound, which settles the conjecture…

We develop a unified approach for establishing rates of decay for the Fourier transform of a wide class of dynamically defined measures. Among the key features of the method is the systematic use of the $L^2$-flattening theorem obtained in…