Linear speed large deviations for percolation clusters

Details Linear speed large deviations for percolation clusters Linear speed large deviations for percolation clusters

2003-10-16

arxiv.org/abs/math/0310256v2

Mathematics

Probability

five pages

Scientific paper

Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta. When d >= 2, and Gamma is any open subset of Omega, we prove: lim_{n \to \infty}(1/n) \log P(C_n \in \Gamma) = -\inf_{S \in \Gamma} \lambda(S) where lambda(S) is the one-dimensional Hausdorff measure of S defined using the {\em correlation norm}: ||u|| := \lim_{n \to \infty} - \frac{1}{n} \log P (u_n \in C_n) where u_n is u rounded to the nearest element of (1/n)Z^d. Given points a^1, >..., a^k in R^d, there are finitely many correlation-norm Steiner trees spanning these points and the origin. We show that if the C_n are each conditioned to contain the points a^1_n,..., a^k_n, then the probability that C_n fails to approximate one of these trees decays exponentially in n.

Affiliated with

Also associated with

No associations

Rating

Linear speed large deviations for percolation clusters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear speed large deviations for percolation clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear speed large deviations for percolation clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440121