A pattern theorem for lattice clusters

Details A pattern theorem for lattice clusters A pattern theorem for lattice clusters

1999-02-12

arxiv.org/abs/math/9902161v1

Mathematics

Probability

Scientific paper

We consider general classes of lattice clusters, including various kinds of animals and trees on different lattices. We prove that if a given local configuration ("pattern") of sites and bonds can occur in large clusters, then it occurs at least cN times in most clusters of size n, for some constant c>0. An analogous theorem for self-avoiding walks was proven in 1963 by Kesten. The results also apply to weighted sums, and in particular we can take a$sub n$ to be the probability that the percolation cluster containing the origin consists of exactly n sites. Another consequence is strict inequality of connective constants for sublattices and for certain subclasses of clusters.

Affiliated with

Also associated with

No associations

Rating

A pattern theorem for lattice 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 A pattern theorem for lattice clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A pattern theorem for lattice clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228277