Inequality of two critical probabilities for percolation.
We consider a generalization of the so-called divide and color model recently introduced by Häggström. We investigate the behavior of the magnetization in large boxes of the lattice and its fluctuations. Thus, Laws of Large Numbers and Central Limit Theorems are proved, both quenched and annealed. We show that the properties of the underlying percolation process deeply influence the behavior of the coloring model. In the subcritical case, the limit magnetization is deterministic and the Central...
We consider a generalization of the so-called divide and color model recently introduced by Häggström. We investigate the behavior of the magnetization in large boxes of the lattice and its fluctuations. Thus, Laws of Large Numbers and Central Limit Theorems are proved, both quenched and annealed. We show that the properties of the underlying percolation process deeply influence the behavior of the coloring model. In the subcritical case, the limit magnetization is deterministic and the Central Limit...
Random interlacements at level is a one parameter family of connected random subsets of , (Ann. Math.171(2010) 2039–2087). Its complement, the vacant set at level , exhibits a non-trivial percolation phase transition in (Comm. Pure Appl. Math.62 (2009) 831–858; Ann. Math.171 (2010) 2039–2087), and the infinite connected component, when it exists, is almost surely unique (Ann. Appl. Probab.19(2009) 454–466). In this paper we study local percolative properties of the vacant set of random interlacements...
Equip the edges of the lattice ℤ2 with i.i.d. random capacities. A law of large numbers is known for the maximal flow crossing a rectangle in ℝ2 when the side lengths of the rectangle go to infinity. We prove that the lower large deviations are of surface order, and we prove the corresponding large deviation principle from below. This extends and improves previous large deviations results of Grimmett and Kesten [9] obtained for boxes of particular orientation.
Ground states of the Edwards–Anderson (EA) spin glass model are studied on infinite graphs with finite degree. Ground states are spin configurations that locally minimize the EA Hamiltonian on each finite set of vertices. A problem with far-reaching consequences in mathematics and physics is to determine the number of ground states for the model on for any . This problem can be seen as the spin glass version of determining the number of infinite geodesics in first-passage percolation or the number...
We consider the standard first passage percolation on : with each edge of the lattice we associate a random capacity. We are interested in the maximal flow through a cylinder in this graph. Under some assumptions Kesten proved in 1987 a law of large numbers for the rescaled flow. Chayes and Chayes established that the large deviations far away below its typical value are of surface order, at least for the Bernoulli percolation and cylinders of certain height. Thanks to another approach we extend...
We pursue the study of a random coloring first passage percolation model introduced by Fontes and Newman. We prove that the asymptotic shape of this first passage percolation model continuously depends on the law of the coloring. The proof uses several couplings, particularly with greedy lattice animals.