Abstract
AbstractWe introduce a formula for translating any upper bound on the percolation threshold of a lattice$G$into a lower bound on the exponential growth rate of lattice animals$a(G)$and vice versa. We exploit this in both directions. We obtain the rigorous lower bound${\dot{p}_c}({\mathbb{Z}}^3)\gt 0.2522$for 3-dimensional site percolation. We also improve on the best known asymptotic bounds on$a({\mathbb{Z}}^d)$as$d\to \infty$. Our formula remains valid if instead of lattice animals we enumerate certain subspecies called interfaces. Enumerating interfaces leads to functional duality formulas that are tightly connected to percolation and are not valid for lattice animals, as well as to strict inequalities for the percolation threshold.Incidentally, we prove that the rate of the exponential decay of the cluster size distribution of Bernoulli percolation is a continuous function of$p\in (0,1)$.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献