A percolation system with extremely long range connections and node dilution

preprint2014arXivOpen access

Abstract

We study the very long-range bond-percolation problem on a linear chain with both sites and bonds dilution. Very long range means that the probability pijp_{ij} for a connection between two occupied sites i,ji,j at a distance rijr_{ij} decays as a power law, i.e. pij=ρ/[rijαN1−α]p_{ij} = ρ/[r_{ij}^αN^{1-α}] when 0≤α<1 0 \le α< 1, and pij=ρ/[rijln⁡(N)]p_{ij} = ρ/[r_{ij} \ln(N)] when α=1α= 1. Site dilution means that the occupancy probability of a site is 0<ps≤10 < p_s \le 1. The behavior of this model results from the competition between long-range connectivity, which enhances the percolation, and site dilution, which weakens percolation. The case α=0α=0 with ps=1p_s =1 is well-known, being the exactly solvable mean-field model. The percolation order parameter P∞P_\infty is investigated numerically for different values of αα, psp_s and ρρ. We show that in the ranges 0≤α≤1 0 \le α\le 1 and 0<ps≤10 < p_s \le 1 the percolation order parameter P∞P_\infty depends only on the average connectivity γγ of sites, which can be explicitly computed in terms of the three parameters αα, psp_s and ρρ.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.