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

In this paper we study uniform versions of two limit theorems in random left truncation model (RLTM). The law of large numbers (LLN) and the central limit theorem (CLT) have been obtained under the bracketing entropy conditions in this…

For graphs $G_0$, $G_1$ and $G_2$, write $G_0\longmapsto(G_1, G_2)$ if each red-blue-edge-coloring of $G_0$ yields a red $G_1$ or a blue $G_2$. The Ramsey number $r(G_1, G_2)$ is the minimum number $n$ such that the complete graph…

A proper coloring of a graph is \emph{conflict-free} if, for every non-isolated vertex, some color is used exactly once on its neighborhood. Caro, Petru\v{s}evski, and \v{S}krekovski proved that every graph $G$ has a proper conflict-free…

Let G be a simple, finite, connected, and undirected graph. The middle graph M(G) of G is obtained from the subdivision graph S(G) after joining pairs of subdivided vertices that lie on adjacent edges of G and the central graph C(G) of G is…

Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…

Given an equation, the integers $[n] = \{1, 2, \dots, n\}$ as inputs, and the colors red and blue, how can we color $[n]$ in order to minimize the number of monochromatic solutions to the equation, and what is the minimum? The answer is…

A $\rho$-mean coloring of a graph is a coloring of the edges such that the average number of colors incident with each vertex is at most $\rho$. For a graph $H$ and for $\rho \geq 1$, the {\em mean Ramsey-Tur\'an number} $RT(n,H,\rho-mean)$…

Fr\'echet means of samples from a probability measure $\mu$ on any smoothly stratified metric space M with curvature bounded above are shown to satisfy a central limit theorem (CLT). The methods and results proceed by introducing and…

A graph $H$ is called common and respectively, strongly common if the number of monochromatic copies of $H$ in a 2-edge-coloring $\phi$ of a large clique is asymptotically minimised by the random coloring with an equal proportion of each…

This paper studies the central limit theorems (CLTs) for linear spectral statistics (LSSs) of general sample covariance matrices, when the test functions belong to $C^3$, the class of functions with continuous third order derivatives. We…

Albertson conjectured that if graph $G$ has chromatic number $r$, then the crossing number of $G$ is at least that of the complete graph $K_r$. This conjecture in the case $r=5$ is equivalent to the four color theorem. It was verified for…

In the random geometric graph $G(n,r_n)$, $n$ vertices are placed randomly in Euclidean $d$-space and edges are added between any pair of vertices distant at most $r_n$ from each other. We establish strong laws of large numbers (LLNs) for a…

We consider a generalization of the so-called divide and color model recently introduced by Haggstrom. We investigate the behaviour of the magnetization in large boxes and its fluctuations. Thus, laws of large numbers and Central Limit…

We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of…

In a paper that appeared in 2010, C. Tone proved a multivariate central limit theorem for some strictly stationary random fields of random vectors satisfying certain mixing conditions. The "normalization" of a given "partial sum" (or "block…

A graph $G$ is $k$-{\em critical} if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. In a very recent paper, we gave a…

We consider a class of theories involving an extension of the Standard Model gauge group to an {\it a priori} arbitrary number of colors, $N_c$, and derive constraints on $N_c$. One motivation for this is the string theory landscape. For…

We develop a central limit theorem (CLT) for a non-parametric estimator of the transition matrices in controlled Markov chains (CMCs) with finite state-action spaces. Our results establish precise conditions on the logging policy under…

We prove a version of the multidimensional Fourth Moment Theorem for chaotic random vectors, in the general context of diffusion Markov generators. In addition to the usual componentwise convergence and unlike the infinite-dimensional…

We consider linear two-time-scale stochastic approximation algorithms driven by martingale noise. Recent applications in machine learning motivate the need to understand finite-time error rates, but conventional stochastic approximation…