Related papers: Moderate and Large Deviations for the Erd\H{o}s-Ka…
Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…
We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…
We prove that the largest and smallest root in modulus of random Kac polynomials have a non-universal behavior. They do not converge towards the edge of the support of the limiting distribution of the zeros. This non-universality is…
We prove that the solution of the Kac analogue of Boltzmann's equation can be viewed as a probability distribution of a sum of a random number of random variables. This fact allows us to study convergence to equilibrium by means of a few…
We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…
Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…
In this paper we consider a dynamic version of the Erd\H{o}s-R\'{e}nyi random graph, in which edges independently appear and disappear in time, with the on- and off times being exponentially distributed. The focus lies on the evolution of…
In this paper, we establish a central limit theorem and a moderate deviations for 2D stochastic primitive equations with multiplicative noise. The proof is mainly based on the weak convergence approach.
We develop a quantitative large deviations theory for random hypergraphs, which rests on tensor decomposition and counting lemmas under a novel family of cut-type norms. As our main application, we obtain sharp asymptotics for joint upper…
In this paper, we prove Erd\H{o}s distance conjecture in $\mathbb{R}^d$, namely, a set of $n$ points in $\mathbb{R}^2$ determines $\Omega(\frac{n}{\sqrt{\log n}})$ distances, and for $d\ge 3$, a set of $n$ points in $\mathbb{R}^d$…
Let $k\geq 2$ be a positive integer. We study concentration results for the ordered representation functions $r^{\leq}_k(A,n) = \# \big\{ (a_1 \leq \dots \leq a_k) \in A^k : a_1+\dots+a_k = n \big\}$ and $r^{<}_k(A,n) = \# \big\{ (a_1 <…
Our purpose is to prove central limit theorem for countable nonhomogeneous Markov chain under the condition of uniform convergence of transition probability matrices for countable nonhomogeneous Markov chain in Ces\`aro sense. Furthermore,…
We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…
The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…
We establish Cram\'er-type moderate deviation theorems for sums of locally dependent random variables and combinatorial central limit theorems. Under some mild exponential moment conditions, optimal error bounds and convergence ranges are…
The central limit theorem for Markov chains generated by iterated function systems consisting of orientation preserving homeomorphisms of the interval is proved. We study also ergodicity of such systems.
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…
An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…
In this paper, we study law of large numbers, central limit theorem, large and moderate deviations for INAR($\infty$) processes, which as a special case, includes both discrete-time linear Hawkes process and INAR(1) process in the…