相关论文: A central limit theorem for the matching number of…

We discuss the spectral asymptotics of some open subsets of the real line with random fractal boundary and of a random fractal, the continuum random tree. In the case of open subsets with random fractal boundary we establish the existence…

In the present work we derive a Central Limit Theorem for sequences of Hilbert-valued Piecewise Deterministic Markov process models and their global fluctuations around their deterministic limit identified by the Law of Large Numbers. We…

Let $B=(B_x)_{x\in\mathbb{R}^d}$ be a collection of $N(0,1)$ random variables forming a real-valued continuous stationary Gaussian field on $\mathbb{R}^d$, and set $C(x-y)=\mathbb{E}[B_xB_y]$. Let $\varphi:\mathbb{R}\to\mathbb{R}$ be such…

We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left convergence to sparse graphs, and describes the limit in terms of a…

A strengthened version of the central limit theorem for discrete random variables is established, relying only on information-theoretic tools and elementary arguments. It is shown that the relative entropy between the standardised sum of…

Consider random Young diagrams with a fixed number n of boxes, where the probability distribution on diagrams is determined by the Plancherel measure. That is, the weight of a diagram is proportional to the squared dimension of the…

We study atypical behavior in bootstrap percolation on the Erd\H{o}s-R\'enyi random graph. Initially a set $S$ is infected. Other vertices are infected once at least $r$ of their neighbors become infected. Janson et al. (2012) locates the…

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

We study the normal approximation of functionals of Poisson measures having the form of a finite sum of multiple integrals. When the integrands are nonnegative, our results yield necessary and sufficient conditions for central limit…

Given a graph $G$ and some initial labelling $\sigma : V(G) \to \{Red, Blue\}$ of its vertices, the \textit{majority dynamics model} is the deterministic process where at each stage, every vertex simultaneously replaces its label with the…

We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled…

We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned 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…

The standard small-time functional central limit theorem of semimartingales has been established in (Gerhold, S., Kleinert, M., Porkert, P., and Shkolnikov, M. (2015). Small time central limit theorems for semimartingales with applications.…

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…

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 note we outline a new and simple approach to proving central limit theorems for various 'global' graph parameters which have robust 'local' approximations, using the Efron--Stein inequality, which relies on a combinatorial analysis…

We prove that for q>=1, there exists r(q)<1 such that for p>r(q), the number of points in large boxes which belongs to the infinite cluster has a normal central limit behaviour under the random cluster measure phi_{p,q} on Z^d, d>=2.…

Many important theorems in combinatorics, such as Szemer\'edi's theorem on arithmetic progressions and the Erd\H{o}s-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In…