Percolation of spatially constraint networks

We study how spatial constraints are reflected in the percolation properties of networks embedded in one-dimensional chains and two-dimensional lattices. We assume long-range connections between sites on the lattice where two sites at distance r are chosen to be linked with probability p(r)∼r ^-δ. Similar distributions have been found in spatially embedded real networks such as social and airline networks. We find that for networks embedded in two dimensions, with 2<δ<4, the percolation properties show new intermediate behavior different from mean field, with critical exponents that depend on δ. For δ<2, the percolation transition belongs to the universality class of percolation in Erdös-Rényi networks (mean field), while for δ>4 it belongs to the universality class of percolation in regular lattices. For networks embedded in one dimension, we find that, for δ<1, the percolation transition is mean field. For 1<δ<2, the critical exponents depend on δ, while for δ>2 there is no percolation transition as in regular linear chains.