Positive dependence for colored percolation
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EWXYEAZArecord.jsonopen to challenge →
read the original abstract
For uniform random 4-colorings of graph edges with colors a,b,c,d, every two colors form a 1/2-percolation, and every two overlapping pairs of colors form independent 1/2-percolations. We show joint positive dependence for pairs of colors ab, ac and ac, and joint negative dependence for pairs of colors ab, ac and bc. The proof is based on a generalization of the Harris--Kleitman inequalities. We apply the results to crossing probabilities for the colored bond and site percolation, and to colored critical percolation that we also define.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.