• Aucun résultat trouvé

Limit theorems for the painting of graphs by clusters

N/A
N/A
Protected

Academic year: 2022

Partager "Limit theorems for the painting of graphs by clusters"

Copied!
14
0
0

Texte intégral

Références

Documents relatifs

Abstract: We established the rate of convergence in the central limit theorem for stopped sums of a class of martingale difference sequences.. Sur la vitesse de convergence dans le

The large-scale limit of Dyson’s hierarchical vector valued model at low temperatures.. The

The quantities g a (i, j), which appear in Theorem 1, involve both the state of the system at time n and the first return time to a fixed state a. We can further analyze them and get

The proof is based on a new central limit theorem for dependent sequences with values in smooth Banach spaces, which is given in Section 3.1.1.. In Section 2.2, we state the

In his paper [T2] Terras obtained a central limit theorem for rotation- invariant random variables on the space of n x n real positive definite (symmetric) matrices in the case n =

Since every separable Banach space is isometric to a linear subspace of a space C(S), our central limit theorem gives as a corollary a general central limit theorem for separable

We now study the scaling limits of discrete looptrees associated with large conditioned Galton–Watson trees, which is a model similar to the one of Boltzmann dissections: With

13 (2016) 121–161] have proved a law of large number and a central limit theorem with respect to the annealed measure for the magnetization of the Ising model on some random