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 positive mutual dependence for pairs of colors ab,ac, and ad, and negative mutual 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.