scholarly journals Large Deviations for Subcritical Bootstrap Percolation on the Erdős–Rényi Graph

2021 ◽  
Vol 185 (2) ◽  
Author(s):  
Omer Angel ◽  
Brett Kolesnik

AbstractWe study atypical behavior in bootstrap percolation on the Erdős–Rényi random graph. Initially a set S is infected. Other vertices are infected once at least r of their neighbors become infected. Janson et al. (Ann Appl Probab 22(5):1989–2047, 2012) locates the critical size of S, above which it is likely that the infection will spread almost everywhere. Below this threshold, a central limit theorem is proved for the size of the eventually infected set. In this work, we calculate the rate function for the event that a small set S eventually infects an unexpected number of vertices, and identify the least-cost trajectory realizing such a large deviation.

2019 ◽  
Vol 21 (01) ◽  
pp. 1750092 ◽  
Author(s):  
Zakhar Kabluchko ◽  
Joscha Prochno ◽  
Christoph Thäle

In this paper, we prove a multivariate central limit theorem for [Formula: see text]-norms of high-dimensional random vectors that are chosen uniformly at random in an [Formula: see text]-ball. As a consequence, we provide several applications on the intersections of [Formula: see text]-balls in the flavor of Schechtman and Schmuckenschläger and obtain a central limit theorem for the length of a projection of an [Formula: see text]-ball onto a line spanned by a random direction [Formula: see text]. The latter generalizes results obtained for the cube by Paouris, Pivovarov and Zinn and by Kabluchko, Litvak and Zaporozhets. Moreover, we complement our central limit theorems by providing a complete description of the large deviation behavior, which covers fluctuations far beyond the Gaussian scale. In the regime [Formula: see text] this displays in speed and rate function deviations of the [Formula: see text]-norm on an [Formula: see text]-ball obtained by Schechtman and Zinn, but we obtain explicit constants.


1996 ◽  
Vol 28 (04) ◽  
pp. 1051-1071 ◽  
Author(s):  
Mike Steel ◽  
Larry Goldstein ◽  
Michael S. Waterman

In phylogenetic analysis it is useful to study the distribution of the parsimony length of a tree under the null model, by which the leaves are independently assigned letters according to prescribed probabilities. Except in one special case, this distribution is difficult to describe exactly. Here we analyze this distribution by providing a recursive and readily computable description, establishing large deviation bounds for the parsimony length of a fixed tree on a single site and for the minimum length (maximum parsimony) tree over several sites. We also show that, under very general conditions, the former distribution converges asymptotically to the normal, thereby settling a recent conjecture. Furthermore, we show how the mean and variance of this distribution can be efficiently calculated. The proof of normality requires a number of new and recent results, as the parsimony length is not directly expressible as a sum of independent random variables, and so normality does not follow immediately from a standard central limit theorem.


1988 ◽  
Vol 104 (3) ◽  
pp. 561-574 ◽  
Author(s):  
Gunnar A. Brosamler

The purpose of this paper is the proof of an almost everywhere version of the classical central limit theorem (CLT). As is well known, the latter states that for IID random variables Y1, Y2, … on a probability space (Ω, , P) with we have weak convergence of the distributions of to the standard normal distribution on ℝ. We recall that weak convergence of finite measures μn on a metric space S to a finite measure μ on S is defined to mean thatfor all bounded, continuous real functions on S. Equivalently, one may require the validity of (1·1) only for bounded, uniformly continuous real functions, or even for all bounded measurable real functions which are μ-a.e. continuous.


2002 ◽  
Vol 39 (04) ◽  
pp. 829-838 ◽  
Author(s):  
Wen-Ming Hong

Moderate deviation principles are established in dimensionsd≥ 3 for super-Brownian motion with random immigration, where the immigration rate is governed by the trajectory of another super-Brownian motion. It fills in the gap between the central limit theorem and large deviation principles for this model which were obtained by Hong and Li (1999) and Hong (2001).


2000 ◽  
Vol 37 (02) ◽  
pp. 417-428
Author(s):  
John E. Glynn ◽  
Peter W. Glynn

This paper describes the limiting asymptotic behaviour of a long cascade of linear reservoirs fed by stationary inflows into the first reservoir. We show that the storage in the nth reservoir becomes asymptotically deterministic as n → ∞, and establish a central limit theorem for the random fluctuations about the deterministic approximation. In addition, we prove a large deviations theorem that provides precise logarithmic asymptotics for the tail probabilities associated with the storage in the nth reservoir when n is large.


2019 ◽  
Vol 09 (02) ◽  
pp. 2050001
Author(s):  
Renjie Feng ◽  
Gang Tian ◽  
Dongyi Wei

In [Spectrum of SYK model, preprint (2018), arXiv:1801.10073], we proved the almost sure convergence of eigenvalues of the SYK model, which can be viewed as a type of law of large numbers in probability theory; in [Spectrum of SYK model II: Central limit theorem, preprint (2018), arXiv:1806.05714], we proved that the linear statistic of eigenvalues satisfies the central limit theorem. In this paper, we continue to study another important theorem in probability theory — the concentration of measure theorem, especially for the Gaussian SYK model. We will prove a large deviation principle (LDP) for the normalized empirical measure of eigenvalues when [Formula: see text], in which case the eigenvalues can be expressed in terms of these of Gaussian random antisymmetric matrices. Such LDP result has its own independent interest in random matrix theory. For general [Formula: see text], we cannot prove the LDP, we will prove a concentration of measure theorem by estimating the Lipschitz norm of the Gaussian SYK model.


2000 ◽  
Vol 37 (2) ◽  
pp. 417-428
Author(s):  
John E. Glynn ◽  
Peter W. Glynn

This paper describes the limiting asymptotic behaviour of a long cascade of linear reservoirs fed by stationary inflows into the first reservoir. We show that the storage in the nth reservoir becomes asymptotically deterministic as n → ∞, and establish a central limit theorem for the random fluctuations about the deterministic approximation. In addition, we prove a large deviations theorem that provides precise logarithmic asymptotics for the tail probabilities associated with the storage in the nth reservoir when n is large.


Sign in / Sign up

Export Citation Format

Share Document