Constrained-degree percolation in random environment

From MaRDI portal



Abstract: We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex v has an independent random constraint kappav which takes the value jin0,1,2,3 with probability hoj. Each edge e attempts to open at a random uniform time Ue in [0,1], independently of all other edges. It succeeds if at time Ue both its end-vertices have degrees strictly smaller than their respectively attached constraints. We show that this model undergoes a non-trivial phase transition when ho3 is sufficiently large. The proof consists of a decoupling inequality, the continuity of the probability for local events, and a coarse-graining argument.












This page was built for publication: Constrained-degree percolation in random environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2083858)