Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

On the critical value function in the divide and color model

Abstract : The divide and color model on a graph G arises by first deleting each edge of G with probability (1-p) independently of each other, then coloring the resulting connected components (i.e., every vertex in the component) black or white with respective probabilities r and (1-r), independently for different components. Viewing it as a (dependent) site percolation model, one can define the critical point r_c(p). In this paper, we first give upper and lower bounds for r_c(p) for general G via a stochastic comparison with Bernoulli percolation, and discuss (non-)monotonicity and (non-)continuity properties of r_c(p) in p. Then we focus on the case G=Z^2 and prove continuity of r_c(p) as a function of p in the interval [0,1/2), and we examine the asymptotic behavior of the critical value function as p tends to its critical value.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Vincent Beffara Connect in order to contact the contributor
Submitted on : Thursday, September 15, 2011 - 5:04:59 PM
Last modification on : Thursday, June 18, 2020 - 10:18:03 AM
Long-term archiving on: : Tuesday, November 13, 2012 - 10:51:50 AM


Files produced by the author(s)


  • HAL Id : ensl-00624097, version 1
  • ARXIV : 1109.3403


András Bálint, Vincent Beffara, Vincent Tassion. On the critical value function in the divide and color model. 2011. ⟨ensl-00624097v1⟩



Record views


Files downloads