Product-sum universality and Rushbrooke inequality in explosive percolation

Universality of explosive percolation under product and sum rule

We study explosive percolation processes on random graphs for the so-called product rule (PR) and sum rule (SR), in which M candidate edges are randomly selected from all possible ones at each time step, and the edge with the smallest product or sum of the sizes of the two components that would be joined by the edge is added to the graph, while all other M-1 candidate edges are being discarded. These two rules are prototypical "explosive" percolation rules, which exhibit an extremely abrupt yet continuous phase transition in the thermodynamic limit. Recently, it has been demonstrated that PR and SR belong to the same universality class for two competing edges, i.e., M=2. Here we investigate whether the claimed PR-SR universality is valid for higher-order models with M larger than 2. Based on traditional finite-size scaling theory and largest-gap scaling, we obtain the percolation threshold and the critical exponents of the order parameter, susceptibility, and the derivative of entropy for PR and SR for M from 2 to 9. Our results strongly suggest PR-SR universality, for any fixed M.

Bond percolation between k separated points on a square lattice

We consider a percolation process in which k points separated by a distance proportional the system size L simultaneously connect together (k>1), or a single point at the center of a system connects to the boundary (k=1), through adjacent connected points of a single cluster. These processes yield new thresholds p[over ¯]_{ck} defined as the average value of p at which the desired connections first occur. These thresholds not sharp, as the distribution of values of p_{ck} for individual samples remains broad in the limit of L→∞. We study p[over ¯]_{ck} for bond percolation on the square lattice and find that p[over ¯]_{ck} are above the normal percolation threshold p_{c}=1/2 and represent specific supercritical states. The p[over ¯]_{ck} can be related to integrals over powers of the function P_{∞}(p) equal to the probability a point is connected to the infinite cluster; we find numerically from both direct simulations and from measurements of P_{∞}(p) on L×L systems that for L→∞, p[over ¯]_{c1}=0.51755(5), p[over ¯]_{c2}=0.53219(5), p[over ¯]_{c3}=0.54456(5), and p[over ¯]_{c4}=0.55527(5). The percolation thresholds p[over ¯]_{ck} remain the same, even when the k points are randomly selected within the lattice. We show that the finite-size corrections scale as L^{-1/ν_{k}} where ν_{k}=ν/(kβ+1), with β=5/36 and ν=4/3 being the ordinary percolation critical exponents, so that ν_{1}=48/41, ν_{2}=24/23, ν_{3}=16/17, ν_{4}=6/7, etc. We also study three-point correlations in the system and show how for p>p_{c}, the correlation ratio goes to 1 (no net correlation) as L→∞, while at p_{c} it reaches the known value of 1.022.

Redefinition of site percolation in light of entropy and the second law of thermodynamics

In this article, we revisit random site and bond percolation in a square lattice, focusing primarily on the behavior of entropy and the order parameter. In the case of traditional site percolation, we find that both the quantities are zero at p=0, revealing that the system is in the perfectly ordered and in the disordered state at the same time. Moreover, we find that entropy with 1-p, which is the equivalent counterpart of temperature, first increases and then decreases again, but we know that entropy with temperature cannot decrease. However, bond percolation does not suffer from either of these two problems. To overcome this, we propose an alternative definition for site percolation where we occupy sites to connect bonds and we measure cluster size by the number of bonds connected by occupied sites. This resolves all the problems without affecting any of the existing known results.

Universality class of explosive percolation in Barabási-Albert networks

In this work, we study explosive percolation (EP) in Barabási-Albert (BA) network, in which nodes are born with degree k = m, for both product rule (PR) and sum rule (SR) of the Achlioptas process. For m = 1 we find that the critical point t_c = 1 which is the maximum possible value of the relative link density t; Hence we cannot have access to the other phase like percolation in one dimension. However, for m > 1 we find that t_c decreases with increasing m and the critical exponents ν, α, β and γ for m > 1 are found to be independent not only of the value of m but also of PR and SR. It implies that they all belong to the same universality class like EP in the Erdös-Rényi network. Besides, the critical exponents obey the Rushbrooke inequality α + 2β + γ ≥ 2 but always close to equality.

    PACS numbers: 61.43.Hv, 64.60.Ht, 68.03.Fg, 82.70.Dd.