The constrained-degree percolation model

Abstract: In the Constrained-degree percolation model on a graph

(m a t h b b V, m a t h b b E)

there are a sequence,

(U_{e})_{e i n m a t h b b 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

U_{e}

, 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

m a t h b b L^{2}

, 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.

Recommendations

Cites Work

Cited In (7)

This page was built for publication: The constrained-degree percolation model