A note on inhomogeneous percolation on ladder graphs

Abstract: Let

m a t h b b G = l e f t (m a t h b b V, m a t h b b E i g h t)

be the graph obtained by taking the cartesian product of an infinite and connected graph

G = (V, E)

and the set of integers

m a t h b b Z

. We choose a collection

m a t h c a l C

of finite connected subgraphs of

G

and consider a model of Bernoulli bond percolation on

m a t h b b G

which assigns probability

q

of being open to each edge whose projection onto

G

lies in some subgraph of

m a t h c a l C

and probability

p

to every other edge. We show that the critical percolation threshold

p_{c} l e f t (q i g h t)

is a continuous function in

l e f t (0, 1 i g h t)

, provided that the graphs in

m a t h c a l C

are "well-spaced" in

G

and their vertex sets have uniformly bounded cardinality. This generalizes a recent result due to Szab'o and Valesin.

Recommendations

Cites Work

Cited In (4)

This page was built for publication: A note on inhomogeneous percolation on ladder graphs