Related papers: Moderate and Large Deviations for the Erd\H{o}s-Ka…

We prove the following variant of the Erd\H{o}s distinct subset sums problem. Given $t \ge 0$ and sufficiently large $n$, every $n$-element set $A$ whose subset sums are distinct modulo $N=2^n+t$ satisfies $$\max A \ge…

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…

In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…

Ordinary differential equations obtained as limits of Markov processes appear in many settings. They may arise by scaling large systems, or by averaging rapidly fluctuating systems, or in systems involving multiple time-scales, by a…

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…

This paper is intended as a sequel to a paper arXiv:0803.2636 written by four of the coauthors here. In the paper, they proved a stronger form of the Erd\H{o}s-Mirksy conjecture which states that there are infinitely many positive integers…

Some differential implications of classical Marx-Strohh\"acker theorem are extended for multivalent functions. These results are also generalized for functions with fixed second coefficient by using the theory of first order differential…

Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…

We establish a large deviation theorem for the empirical spectral distribution of random covariance matrices whose entries are independent random variables with mean 0, variance 1 and having controlled forth moments. Some new properties of…

Riesz space (non-pointwise) generalizations for iterative processes are given for the concepts of recurrence, first recurrence and conditional ergodicity. Riesz space conditional versions of the Poincar\'{e} Recurrence Theorem and the Kac…

Using martingale methods, we obtain some upper bounds for large and moderate deviations of products of independent and identically distributed elements of GL d (R). We investigate all the possible moment conditions, from super-exponential…

We study the large deviations of sums of correlated random variables described by a matrix product ansatz, which generalizes the product structure of independent random variables to matrices whose non-commutativity is the source of…

In this paper, using the compression method, we recover the lower bound for the Erd\H{o}s unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in $\mathbb{R}^k$ for all $k\geq 2$, we…

Selberg's central limit theorem states that the values of $\log|\zeta(1/2+i \tau)|$, where $\tau$ is a uniform random variable on $[T,2T]$, is distributed like a Gaussian random variable of mean $0$ and standard deviation…

In this note, we provide an explicit upper bound for $h_K \mathcal{R}_K d_K^{-1/2}$ which depends on an effective constant in the error term of the Ideal Theorem.

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…

The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x_1^n using the entropy of the k-block empirical probability and letting k grow with $n$ roughly like log n. We further assume that the…

The term "moderate deviations" is often used in the literature to mean a class of large deviation principles that, in some sense, fill the gap between a convergence in probability to zero (governed by a large deviation principle) and a weak…

The Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ asks one to show that if $E \subset \mathbb{Z}_q^d$ is of sufficiently large cardinality, then $\Delta(E) := \{(x_1 - y_1)^2 + \dots + (x_d - y_d)^2 : x, y \in E\}$ satisfies…