Displaying similar documents to “Limit theorems for the painting of graphs by clusters”

Asymptotic shape for the chemical distance and first-passage percolation on the infinite Bernoulli cluster

Olivier Garet, Régine Marchand (2004)

ESAIM: Probability and Statistics

Similarity:

The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolation on ℤ d to first-passage percolation on a random environment given by the infinite cluster of a supercritical Bernoulli percolation model. We prove the convergence of the renormalized set of wet vertices to a deterministic shape that does not depend on the realization of the infinite cluster. As a special case of our result, we obtain an asymptotic shape theorem for the chemical distance...

Exponential inequalities and functional central limit theorems for random fields

Jérôme Dedecker (2001)

ESAIM: Probability and Statistics

Similarity:

We establish new exponential inequalities for partial sums of random fields. Next, using classical chaining arguments, we give sufficient conditions for partial sum processes indexed by large classes of sets to converge to a set-indexed brownian motion. For stationary fields of bounded random variables, the condition is expressed in terms of a series of conditional expectations. For non-uniform φ -mixing random fields, we require both finite fourth moments and an algebraic decay of the...