Antipercolation
An A B percolation is a discrete percolation model in which the underlying point lattice graph ℒ has the properties that each of its graph vertices is occupied by an atom either of type A or of type B, that there is a probability p that any given vertex is occupied by an atom of type A, and that different vertices are occupied independently of each other. In this model, a graph edge of ℒ is said to be open if its end vertices are occupied by atoms of different types and is said to be closed otherwise. The idea is based on the hypothesis that dissimilar atoms bond together whereas similar atoms repel one another. This model is sometimes studied under the title antipercolation.
Bernoulli percolation model | bond percolation | Boolean model | Boolean-Poisson model | bootstrap percolation | Cayley tree | cluster | cluster perimeter | continuum percolation theory | dependent percolation | discrete percolation theory | disk model | first-passage percolation | germ-grain model | inhomogeneous percolation model | lattice animal | long-range percolation model | mixed percolation model | oriented percolation model | percolation | percolation theory | percolation threshold | polyomino | random-cluster model | random-connection model | random walk | s-cluster | site percolation | s-run
