Abstract: 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 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 15995 (Why is no real title available?)
- scientific article; zbMATH DE number 201032 (Why is no real title available?)
- scientific article; zbMATH DE number 3088537 (Why is no real title available?)
- A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
- An Introduction to the Geometry of Numbers
- Cell Growth Problems
- Entanglement complexity of lattice ribbons
- Lattice Models of Polymers
- Metropolis Monte Carlo simulation of lattice animals
- On the Number of Self-Avoiding Walks
- Self-avoiding walks and polygons on non-Euclidean lattices
- Statistics of lattice animals
- Submaps of maps. I: General 0-1 laws
- The free energy of a collapsing branched polymer
- The number and size of branched polymers in high dimensions
Cited in
(31)- Polycubes with small perimeter defect
- Counting Polycubes without the Dimensionality Curse
- Pattern theorems, ratio limit theorems and Gumbel maximal clusters for random fields
- Adsorption of lattice polymers with quenched topologies
- Formulae and growth rates of high-dimensional polycubes
- Concatenation arguments and their applications to polyominoes and polycubes
- The growth rate of high-dimensional tree polycubes
- An improved lower bound on the growth constant of polyiamonds
- The growth rate of high-dimensional tree polycubes
- Enumerating polyominoes with fixed perimeter defect
- Recovering highly-complex linear recurrences of integer sequences
- Knotted 2-spheres in tubes in \(\mathbb Z^4\)
- The number of polyiamonds is supermultiplicative
- Automatic generation of formulae for polyominoes with a fixed perimeter defect
- Counting \(n\)-cell polycubes proper in \(n - k\) dimensions
- Lattice Polygons and Related Objects
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
- An improved upper bound on the growth constant of polyiamonds
- Counting polycubes without the dimensionality curse
- Formulae and growth rates of high-dimensional polycubes
- Improved upper bounds on the growth constants of polyominoes and polycubes
- On the number of entangled clusters
- A Dynamical System Approach to Polyominoes Generation*
- Algorithms for counting minimum-perimeter lattice animals
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
- An improved upper bound on the growth constant of polyominoes
- The linking probability for 2-component links which span a lattice tube
- \(\lambda > 4\)
- On the number of hexagonal polyominoes
- scientific article; zbMATH DE number 7559264 (Why is no real title available?)
- Expansion in high dimension for the growth constants of lattice trees and lattice animals
This page was built for publication: A pattern theorem for lattice clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306609)
