Scaling relations and finite-size scaling in gravitationally correlated lattice percolation models

Abstract

In some systems, the connecting probability (and thus the percolation process) between two sites depends on the geometric distance between them. To understand such process, we propose gravitationally correlated percolation models for link-adding networks on the two-dimensional lattice $G$ with two strategies $S_{\max }$ and $S_{\min }$, to add a link $l_{i,j}$ to connect site $i$ and site $j$ with mass $m_i$ and $m_j$, respectively; $m_i$ and $m_j$ are sizes of the clusters which contain site $i$ and site $j$, respectively. The probability to add the link $l_{i,j}$ is related to the generalized gravity $g_{ij}\equiv m_i{m}_j/r_{ij}^d$, where $r_{ij}$ is the geometric distance between $i$ and $j$, and $d$ is an adjustable decaying exponent. In the beginning of the simulation, all sites of $G$ are occupied and there is no link. In the simulation process, two inter-cluster links $l_{i,j}$ and $l_{k,n}$ are randomly chosen and the generalized gravities $g_{ij}$ and $g_{kn}$ are computed. In the strategy $S_{\max }$, the link with larger generalized gravity is added. In the strategy $S_{\min }$, the link with smaller generalized gravity is added, which include percolation on the Erd\H os-Rényi random graph and the Achlioptas process of explosive percolation as the limiting cases, $d\to \infty$ and $d\to 0$, respectively. Adjustable strategies facilitate or inhibit the network percolation in a generic view. We calculate percolation thresholds $T_c$ and critical exponents $\beta$ by numerical simulations. We also obtain various finite-size scaling functions for the node fractions in percolating clusters or arrival of saturation length with different intervening strategies.

26 pages, 8 figures, Chinese Journal of Physics, accepted for publication

References in corpus (12)

• Recent advances in percolation theory and its applications
• Explosive transitions in complex networks' structure and dynamics: percolation and synchronization
• Percolation on sparse networks
• Self-organized adaptation of a simple neural circuit enables complex robot behaviour
• Impact of Single Links in Competitive Percolation -- How complex networks grow under competition
• Explosive percolation in scale-free networks
• Explosive percolation via control of the largest cluster
• Predicting percolation thresholds in networks
• Tricritical point in explosive percolation
• Worm Epidemics in Wireless Adhoc Networks
• Scaling of critical connectivity of mobile ad hoc communication networks
• Mapping functions and critical behavior of percolation on rectangular domains

Cited by in corpus (4)

• Hidden superuniversality in systems with continuous variation of critical exponents
• Exact three spin correlation function relations for the square and the honeycomb Ising lattices
• Relevant alternative analytic average magnetization calculation method for the square and the honeycomb Ising lattices
• Analytic average magnetization expression for the body centered cubic Ising lattice