Greedy lattice animals: geometry and criticality

DOI10.1214/009117905000000693zbMath1097.60081arXivmath/0411459OpenAlexW2060586887MaRDI QIDQ2496960

Alan Hammond

Publication date: 26 July 2006

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0411459

zbMATH Keywords

optimizationpercolation

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (4)

Paths and animals in infinite graphs with tempered degree growth ⋮ Correlation length of the two-dimensional random field Ising model via greedy lattice animal ⋮ Boundary-connectivity via graph theory ⋮ Greedy lattice animals: geometry and criticality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The continuity of \(M\) and \(N\) in greedy lattice animals
• The power laws of \(M\) and \(N\) in greedy lattice animals
• Greedy lattice animals. I: Upper bounds
• An inequality for greedy lattice animals
• Greedy lattice animals. II: Linear growth
• Domination by product measures
• Linear growth for greedy lattice animals.
• Strict inequalities for some critical exponents in two-dimensional percolation
• Greedy lattice animals: Negative values and unconstrained maxima
• Isoperimetry and heat kernel decay on percolation clusters.
• Greedy lattice animals: geometry and criticality
• On the chemical distance for supercritical Bernoulli percolation
• Differential Topology
• Percolation
• Large deviations for discrete and continuous percolation
• An inequality related to the isoperimetric inequality
• Probability

This page was built for publication: Greedy lattice animals: geometry and criticality