相关论文: Normal Approximation and Fourth Moment Theorems fo…

We consider the nodal length $L(\lambda)$ of the restriction to a ball of radius $r_\lambda$ of a {\it Gaussian pullback monochromatic random wave} of parameter $\lambda>0$ associated with a Riemann surface $(\mathcal M,g)$ without…

We prove a central limit theorem (CLT) for the number of joint orbits of random tuples of commuting permutations. In the uniform sampling case this generalizes the classic CLT of Goncharov for the number of cycles of a single random…

Let $T(K_{1, r}, G_n)$ be the number of monochromatic copies of the $r$-star $K_{1, r}$ in a uniformly random coloring of the vertices of the graph $G_n$. In this paper we provide a complete characterization of the limiting distribution of…

We present a new approach, inspired by Stein's method, to prove a central limit theorem (CLT) for linear statistics of $\beta$-ensembles in the one-cut regime. Compared with the previous proofs, our result requires less regularity on the…

We prove the central limit theorem (CLT) for a sequence of independent zero-mean random variables $\xi_j$, perturbed by predictable multiplicative factors $\lambda_j$ with values in intervals $[\underline\lambda_j,\overline\lambda_j]$. It…

The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…

Linear structural error-in-variables models with univariate observations are revisited for studying modified least squares estimators of the slope and intercept. New marginal central limit theorems (CLT's) are established for these…

A classic result of Erd\H{o}s, Gy\'arf\'as and Pyber states that for every coloring of the edges of $K_n$ with $r$ colors, there is a cover of its vertex set by at most $f(r) = O(r^2 \log r)$ vertex-disjoint monochromatic cycles. In…

Let $G$ be an edge-colored graph on $n$ vertices. The minimum color degree of $G$, denoted by $\delta^c(G)$, is defined as the minimum number of colors assigned to the edges incident to a vertex in $G$. In 2013, H. Li proved that an…

In its Euclidean form, the Dense Neighborhood Lemma (DNL) asserts that if $V$ is a finite set of points of $\mathbb{R}^N$ such that for each $v \in V$ the ball $B(v,1)$ intersects $V$ on at least $\delta |V|$ points, then for every…

In 1959, Goodman determined the minimum number of monochromatic triangles in a complete graph whose edge set is two-coloured. Goodman also raised the question of proving analogous results for complete graphs whose edge sets are coloured…

Mantel's Theorem asserts that a simple $n$ vertex graph with more than $\frac{1}{4}n^2$ edges has a triangle (three mutually adjacent vertices). Here we consider a rainbow variant of this problem. We prove that whenever $G_1, G_2, G_3$ are…

We revisit the central limit theorem for integrated periodograms, equivalently for Toeplitz quadratic forms of stationary Gaussian sequences. Under a regular-variation assumption allowing long-memory singularities and slowly varying…

The law of large numbers (LLN) and central limit theorem (CLT) are long and widely been known as two fundamental results in probability theory. Recently problems of model uncertainties in statistics, measures of risk and superhedging in…

Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four…

We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…

We obtain convergence rates (in the Levi-Prokhorove metric) in the functional central limit theorem (CLT) for partial sums $S_n=\sum_{j=1}^{n}\xi_{j,n}$ of triangular arrays $\{\xi_{1,n},\xi_{2,n},...,\xi_{n,n}\}$ satisfying some mixing and…

We study the fluctuations of the eigenvalues of real valued large centrosymmetric random matrices via its linear eigenvalue statistic. This is essentially a central limit theorem (CLT) for sums of dependent random variables. The dependence…

In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated around the true number of triangles. Specifically, if $p \geq…

We formulate and prove a new sufficient conditions for Central Limit Theorem(CLT) in the space of continuous functions in the terms typical for the approximation theory. We prove that the conditions for continuous CLT obtained by N.C.Jain…