Linear Lower Bounds for $δ_c(p)$ for a Class of 2D Self-Destructive Percolation Models

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The self-destructive percolation model is defined as follows: Consider percolation with parameter $p > p_c$. Remove the infinite occupied cluster. Finally, give each vertex (or, for bond percolation, each edge) that at this stage is vacant, an extra chance $\delta$ to become occupied. Let $\delta_c(p)$ be the minimal value of $\delta$, needed to obtain an infinite occupied cluster in the final configuration. This model was introduced some years ago by van den Berg and Brouwer. They showed that, for the site model on the square lattice (and a few other 2D lattices satisfying a special technical condition) that $\delta_c(p)\geq\frac{(p-p_c)}{p}$. In particular, $\delta_c(p)$ is at least linear in $p-p_c$. Although the arguments used by van den Berg and Brouwer look quite rigid, we show that they can be suitably modified to obtain similar linear lower bounds for $\delta_c(p)$ (with $p$ near $p_c$) for a much larger class of 2D lattices, including bond percolation on the square and triangular lattices, and site percolation on the star lattice (or matching lattice) of the square lattice.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Linear Lower Bounds for $δ_c(p)$ for a Class of 2D Self-Destructive Percolation Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Lower Bounds for $δ_c(p)$ for a Class of 2D Self-Destructive Percolation Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Lower Bounds for $δ_c(p)$ for a Class of 2D Self-Destructive Percolation Models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-310757

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.