Abstract
In the Constrained-degree percolation model on a graph (V,E) there are a sequence, (Ue)e∈E, of i.i.d. random variables with distribution U[0,1] and a positive integer k. Each bond e tries to open at time Ue, it succeeds if both its end-vertices would have degrees at most k−1. We prove a phase transition theorem for this model on the square lattice L2, as well as on the d-ary regular tree. We also prove that on the square lattice the infinite cluster is unique in the supercritical phase.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.