Title

Interference percolation

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

Share

COinS