Greedy lattice animals: geometry and criticality
From MaRDI portal
(Redirected from Publication:2496960)
Abstract: Assign to each site of the integer lattice a real score, sampled according to the same distribution , independently of the choices made at all other sites. A lattice animal is a finite connected set of sites, with its weight being the sum of the scores at its sites. Let be the maximal weight of those lattice animals of size that contain the origin. Denote by the almost sure finite constant limit of , which exists under a mild condition on the positive tail of . We study certain geometrical aspects of the lattice animal with maximal weight among those contained in an -box where is large, both in the supercritical phase where , and in the critical case where .
Recommendations
Cites work
- An inequality for greedy lattice animals
- An inequality related to the isoperimetric inequality
- Differential Topology
- Domination by product measures
- Greedy lattice animals. I: Upper bounds
- Greedy lattice animals. II: Linear growth
- Greedy lattice animals: geometry and criticality
- Greedy lattice animals: Negative values and unconstrained maxima
- scientific article; zbMATH DE number 3826957 (Why is no real title available?)
- scientific article; zbMATH DE number 3971949 (Why is no real title available?)
- scientific article; zbMATH DE number 18980 (Why is no real title available?)
- scientific article; zbMATH DE number 714498 (Why is no real title available?)
- scientific article; zbMATH DE number 897154 (Why is no real title available?)
- Isoperimetry and heat kernel decay on percolation clusters.
- Large deviations for discrete and continuous percolation
- Linear growth for greedy lattice animals.
- On the chemical distance for supercritical Bernoulli percolation
- Percolation
- Probability. Theory and examples.
- Strict inequalities for some critical exponents in two-dimensional percolation
- The continuity of \(M\) and \(N\) in greedy lattice animals
- The power laws of \(M\) and \(N\) in greedy lattice animals
Cited in
(14)- The power laws of \(M\) and \(N\) in greedy lattice animals
- Greedy lattice animals. I: Upper bounds
- Greedy lattice animals. II: Linear growth
- Linear growth for greedy lattice animals.
- Geometry for mutualistic and selfish herds: the limited domain of danger
- Greedy lattice animals: geometry and criticality
- scientific article; zbMATH DE number 119911 (Why is no real title available?)
- Paths and animals in infinite graphs with tempered degree growth
- Statistics of collapsing lattice animals
- Boundary-connectivity via graph theory
- Correlation length of the two-dimensional random field Ising model via greedy lattice animal
- Long range order for three-dimensional random field Ising model throughout the entire low temperature regime
- Law of large numbers for greedy animals and paths in an ergodic environment
- Crystal growth on locally finite partially ordered sets
This page was built for publication: Greedy lattice animals: geometry and criticality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496960)