Interference percolation

Authors

Paul Balister, University of MemphisFollow
Béla Bollobás, University of MemphisFollow

Abstract

Let G be an infinite connected graph with minimum degree δ and maximum degree Δ. Let Gp be a random induced subgraph of G obtained by selecting each vertex of G independently with probability p, 0

Publication Title

Random Structures and Algorithms

Recommended Citation

Balister, P., & Bollobás, B. (2014). Interference percolation. Random Structures and Algorithms, 44 (4), 399-418. https://doi.org/10.1002/rsa.20484