Phase transitions in diluted negativeweight percolation models
Abstract
We investigate the geometric properties of loops on twodimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of total negative weight. The resulting percolation problem is fundamentally different from conventional percolation, as we have seen in a previous study of this model for the undiluted case.
Here, we investigate how the percolation transition is affected by additional dilution. We consider two types of dilution: either a certain fraction of edges exhibit zero weight, or a fraction of edges is even absent. We study these systems numerically using exact combinatorial optimization techniques based on suitable transformations of the graphs and applying matching algorithms. We perform a finitesize scaling analysis to obtain the phase diagram and determine the critical properties of the phase boundary. We find that the first type of dilution does not change the universality class compared to the undiluted case whereas the second type of dilution leads to a change of the universality class.
pacs:
64.60.ah, 75.40.Mg, 02.60.Pn, 68.35.RhI Introduction
Percolation is one of the most fundamental problems in statistical mechanics stauffer1979 (); stauffer1994 (). Its ideas apply to physical disciplines as different as solidstate physics and cosmology and it has the ability to describe many phase transitions in a completely geometric and probabilistic context. The pivotal question in percolation theory is that of connectivity. Consider for example randombond percolation where one studies a lattice that is randomly filled with a certain fraction of edges. Clusters of connected sites are then analyzed regarding their geometric properties. Depending on the fraction of edges on the lattice, the geometric properties of the clusters change, leading from a phase with rather small and disconnected clusters to a phase where there is basically one large cluster dominating the lattice. Therein, the appearance of an infinite, i.e. percolating, cluster is described by a second order phase transition. In the past decades, a large number of percolation problems have been investigated in various contexts through numerical simulations. Among those are problems where the objects of interest are stringlike, rather than clusters as in the standard case explained above. The geometric properties of stringlike objects have been studied and quantified in diverse contexts schwartz1998 (); hindmarsch1995 (); engels1996 (); schakel2001 (); bittner2005 (); wenzel2005 (); antunes1998 (); pfeiffer2003 (). Recently melchert2008 () we have investigated negative weight percolation (NWP), a problem in similar vein but with subtle differences compared to other stringlike percolation problems. In NWP, we consider a regular lattice with periodic boundary conditions where all adjacent sites are joined by undirected edges. Weights are assigned to the edges, representing quenched random variables drawn from a distribution that allows for edge weights of either sign. The details of the weight distribution is therein controlled by a disorder parameter. For a given realization of the disorder, we then ask for a configuration of loops, i.e. closed polygons on the lattice, such that the sum of the edge weights that make up the loops is minimal. The problem of finding these loops can be cast into a minimumweightpath (MWP) problem as will be explained below in more detail. This MWP is also of relevance for the problem of finding domainwall excitations in 2d Ising spin glasses melchert2007 (). One feature of this particular MWP problem is that there is no modularity, meaning that a path obeying the optimization constraint can have subpaths that do not meet the optimization criterion. We further impose the constraint that the loops are not allowed to intersect, as a result there is no definition of clusters in NWP.
Previously we investigated NWP on twodimensional lattices. We found a critical value of the disorder parameter above which percolating loops emerge in the limit of large system sizes. We further determined a whole set of critical exponents that characterize the underlying disorderinduced and geometric phase transition. These exponents where clearly different from those describing other percolation transitions. Moreover, the critical exponents where found to be universal in , meaning that they do not depend on the details of the disorder distribution or the lattice geometry.
Albeit there are essential differences between NWP and usual bond percolation described above, the features of the latter are important if we ask for the effect of dilution on the characteristics of NWP. Here, we investigate the effect of dilution on the critical properties of NWP. Therefore we use observables from percolation theory and a finitesizescaling (FSS) analysis to probe critical lines in the disorderdilution plane for two different types of dilution described below. Further, we check whether the critical exponents change along the critical lines. We therefore analyze the critical exponent that describes the divergence of a typical length scale in NWP as we approach the critical point. For one distinguished point in the disorderdilution plane, a more complete analysis involving more critical exponents is given as well.
Ii Model and Algorithm
In the framework of this paper, we consider square lattices with side length and fully periodic boundary conditions (BCs), i.e. sites and a maximal number of (in case of no dilution) edges joining adjacent sites . We further assign a weight/cost to each edge contained in , representing quenched random variables that introduce disorder to the lattice. One realization of the undiluted disorder therein consists of a fraction of edge weights drawn from a Gaussian distribution with zero mean and unit width, together with edges with unit weight (fraction ). This weight distribution explicitly allows for loops , i.e. closed polygons on the lattice, with a negative total weight . For any nonzero value of the disorder parameter , a sufficiently large lattice will exhibit at least small loops with a weight smaller than zero. If the disorder parameter is sufficiently large, even large loops with negative weight will appear, which span the system. Hence, the system is percolating in this case. Here, as an additional source of disorder, we consider two different types of dilution, affecting the lattice edges:

Type I: The disorder is characterized by a fraction of edge weights . This does not mean that the respective bonds are absent in terms of bond percolation. Instead, a loop can include these edges without an increase of the configurational energy, see figure 1(a);

Type II: The lattice is diluted by a fraction of absent bonds. Depending on the value of , this induces a usual random bond percolation process that will affect the negative weight percolation (NWP) of loops, see figure 1(b).
Given together with a realization of the disorder, we determine a set of loops such that the configurational energy, defined as the sum of all the loopweights , is minimized. As further optimization constraint, the loops are not allowed to intersect and generally, the weight of an individual loop is smaller than zero. Note that may also be empty. Clearly, the configurational energy is the quantity subject to optimization and the result of the optimization procedure is a set of loops , obtained using an appropriate transformation of the original graph as detailed in ahuja1993 (). So as to identify the edges that constitute the loops for a particular instance of the disorder, we need to obtain a minimumweighted perfect matching (MWPM) cook1999 (); optphys2001 () on the transformed graph.
Here, we give a brief description of the algorithmic procedure that yields a minimum weight set of loops for a given realization of the disorder. Figure 2 illustrates the 3 basic steps, detailed below:
(1) each edge, joining adjacent sites on the original graph , is replaced by a path of 3 edges. Therefore, 2 “additional” sites have to be introduced for each edge in . Therein, one of the two edges connecting an additional site to an original site gets the same weight as the corresponding edge in . The remaining two edges get zero weight. The original sites are then “duplicated”, i.e. , along with all their incident edges and the corresponding weights. For each of these pairs of duplicated sites, one additional edge with zero weight is added that connects the two sites and . The resulting auxiliary graph is shown in figure 2(b), where additional sites appear as squares and duplicated sites as circles. Figure 2(b) also illustrates the weight assignment on the transformed graph . Note that while the original graph (figure 2(a)) is symmetric, the transformed graph (figure 2(b)) is not. This is due to the details of the mapping procedure and the particular weight assignment we have chosen. A more extensive description of the mapping can be found in melchert2007 ().
(2) a MWPM on the auxiliary graph is determined via exact combinatorial optimization algorithms comment_cookrohe (). A MWPM is a minimumweighted subset of , such that each site contained in is met by precisely one edge in . This is illustrated in figure 2(c), where the solid edges represent for the given weight assignment. The dashed edges are not matched. Due to construction, the auxiliary graph consists of an even number of sites and since there are no isolated sites, it is guaranteed that a perfect matching exists. Even if theres no edge on , i.e. in terms of the dilution introduced above. In that extreme case, consists solely of the “duplicated” sites that are joined pairwise by zeroweighted edges. A perfect matching trivially exists and the corresponding MWPM has weight zero.
(3) finally it is possible to find a relation between the matched edges on and a configuration of negativeweighted loops on by tracing the steps of the transformation (1) back. In this regard note that each edge contained in that connects an additional site (square) to a duplicated site (circle) corresponds to an edge on that is part of a loop, see figure 2(d). More precisely, there are always two such edges in that correspond to one loop segment on . All the edges in that connect like sites (i.e. duplicatedduplicated, or additionaladditional) carry zero weight and do not contribute to a loop on . Once the set of loops is found, a depthfirst search ahuja1993 (); optphys2001 () can be used to explore and to determine the geometric properties of the individual loops. For the weight assignment in figure 2(a), there is only one loop with weight and length .
Note that the result of the calculation is a collection of loops such that the total loop weight, and consequently the configurational energy , is minimized. Hence, one obtains a global collective optimum of the system. Obviously, all loops that contribute to possess a negative weight. Regarding the weight assignment in step (1) there are different possibilities that all result in equivalent sets of matched edges on the transformed lattice, corresponding to the minimumweight collection of loops on the original lattice. Some of these weight assignments lead to a more symmetric transformed graph, see e.g. ahuja1993 (). However, this is only a technical issue that does not affect the resulting loop configuration. Albeit the transformed graph is not symmetric, the resulting graph (figure 2(d)) is again symmetric.
In the following we will use the procedure outlined above to investigate the effect of dilution on the critical properties of NWP.
Iii Results
So as to clarify the effect of dilution on the critical properties of NWP, we first need to locate the critical lines in the planes that separate the percolating from the nonpercolating domains. Therefore, we use observables from percolation theory and a finitesizescaling analysis. Besides the weight and length of an individual loop, we determine its linear extensions by projecting it onto the perpendicular lattice axes. The larger of the two is called the spanning length of the loop and the smaller one is called its roughness. Consequently, a loop is called percolating if its spanning length is equal to the system size . This is a binary decision for each disorder instance that is further used to obtain the percolation probability for a lattice of a certain size at a given value of the disorder and dilution parameters and , respectively. Note that system spanning loops are a direct consequence of the periodic boundary conditions we employ. For completeness, we note that we used the number to signify a sample containing a percolating loop and otherwise. In practice, we fix one of the parameters, say , and tune the value of so as to determine the critical point beyond which percolating loops emerge in the limit of large system sizes at that particular value of . For clarity, at fixed is simply denoted as . Referring to percolation theory stauffer1994 (), is expected to scale as , where denotes the critical exponent that describes the divergence of the typical length scale as the critical point is approached. Since we consider stringlike objects, it is possible to find more than just one percolating loop per disorder instance. In a preceding work melchert2008 () we found that the average number of percolating loops per sample satisfies the scaling relation governed by the same values for and as the percolation probability. Therein was found to exceed a value of above the critical point, similar to what was found earlier for a different loop percolation model subject to optimization constraints pfeiffer2003 (). This is in contrast to usual randombond percolation, where the objects of interest are cluster of connected sites on the lattice and where there is a unique percolating cluster above the percolation threshold.
0.05  0.449(2)  1.49(13)  1.19 
0.10  0.394(2)  1.52(14)  1.19 
0.15  0.334(1)  1.52(2)  1.43 
0.20  0.264(2)  1.52(9)  1.00 
0.200(2)  0.264  1.45(12)  0.91 
0.25  0.184(2)  1.52(11)  1.21 
0.249(2)  0.184  1.51(14)  0.91 
0.30  0.088(2)  1.51(7)  0.72 
0.340(1)  0.000  1.49(7)  0.91 
iii.1 Type I dilution
As described above, we allow for a fraction of edges that carry zero weight. A loop can include those edges without increasing its weight or the configurational energy. As a consequence, for values of percolating loops can emerge even if the disorder parameter has a value smaller than its critical value along the axis, i.e. . In particular for , there is a system spanning cluster of edges with zero weight and for an arbitrarily small value of will suffice to generate percolating loops on the lattice.
First, we probed the critical line that separates the nonpercolating (small at fixed ) and the percolating domains in the disorder–dilution plane. For this purpose, we performed simulations for systems of size , the number of samples ranging from for to for the largest systems. Within the scaling analysis, we fixed the disorder parameter at values listed in table 1 and varied the dilution so as to determine the critical point at which percolating loops emerge. As an indicator for the transition, we therefore study the finitesizepercolation probability . The resulting phase diagram is depicted in figure 3(a) and a scaling analysis for one of the points along the critical line is shown in figure 4(a). A data collapse involving data sets for different system sizes can be used to estimate and . The quality of the data collapse is therein measured by the mean square distance of the data sets to the master curve in units of the standard error houdayer2004 (), see table 1. For the example illustrated in figure 4(a), where the disorder parameter was fixed to , the scaling analysis resulted in a value for the dilution above which percolating loops are present in the system. It further yields a value for the critical exponent that describes the divergence of the correlation length. For consistency, we checked some of the points by performing simulations along both axis: in addition to the data obtained at fixed we performed simulations at fixed , probing the critical point along the axis. For example, probing along the axis at we found , while probing along the axis at we obtained in complete agreement. Albeit the sample numbers in the present study are somewhat smaller than in melchert2008 () that led to the estimate of at , the numerical values we obtain for along the critical line are consistent with the value of reported there. This leads us to conclude that type I dilution does not change the universality class of NWP. Note that it is not possible to find negative weighted loops along the and axes since at least one edge with a negative edge weight is need in order to form a loop.
0.340(1)  0.0  1.49(7)  0.91 
0.4  0.125(2)  1.49(9)  0.97 
0.5  0.265(2)  1.49(15)  1.02 
0.6  0.357(2)  1.49(11)  1.03 
0.7  0.420(2)  1.47(11)  1.02 
0.8  0.463(1)  1.47(11)  0.93 
0.9  0.4893(9)  1.41(8)  1.20 
1.0  0.4998(5)  1.33(5)  0.98 
iii.2 Type II dilution
As detailed above, we allow for a fraction of absent edges on the lattice. In terms of randombond percolation, one can expect that the lattice decomposes into independent clusters of connected sites for . Therefore its very unlikely to find negative weighted loops with a spanning length equal to for values of the dilution that exceed . Proceeding as above, we fixed the value of the disorder parameter to the values listed in table 2 and tuned the value of the dilution parameter so as to probe the corresponding critical points , above which percolating loops cease to exist (large at fixed ). We performed simulations for systems of size . The number of samples ranged from for to for the largest systems. We performed in each case a FSS analysis. Only at we carried out further simulations at ( samples) so as to decrease finitesize effects furthermore and to establish a more reliable scaling analysis to settle a value for the critical exponent . Figure 4(b) illustrates a scaling analysis for fixed , corresponding to the rightmost data point in figure 3(b). Instead of the percolation probability shown for the type I dilution in figure 4(a), we here show the average area of the smallest box that fits the largest loop on the lattice normalized by the system size. In the same manner as the percolation probability, this quantity approaches a step function in the limit of large system sizes and its finite size scaling behavior follows the analogous form . For fixed the FSS of the observable yields a critical value of the dilution parameter and the critical exponent with a quality of the data collapse. These findings are in complete agreement with the corresponding values listed in table 2 that where obtained by means of the percolation probability. It is interesting to note that the exponent steadily decreases from the value found for the undiluted model at to the value at and , see table 3. The latter two values are also characteristic for random bond percolation in 2d, that is the accompanying process for NWP subject to the type of dilution under investigation. The change of the exponent indicates the introduction of type II dilution changes the universality class of NWP. In particular, since the value of is compatible with the standard percolation exponent, we ask the question whether the NWP is here equivalent to standard percolation, although we look for loops of negative weight instead for percolating clusters. In the following we present a more detailed analysis of the critical point at and , which shows that indeed the NWP behavior at is not equivalent to standard percolation.
Type  

RBP  0.5  –  4/3  5/36  43/18  187/91  91/48 
NWP  0.0  0.340(1)  1.49(7)  1.07(6)  0.77(7)  2.59(3)  1.266(2) 
NWP  0.4998(5)  1.0  1.33(5)  0.89(4)  0.89(6)  2.54(5)  1.333(2) 
iii.3 Detailed analysis at and
Above we found the critical point and the exponent from a FSS analysis of the average normalized box size . Further, the average normalized loop length can be used to obtain a further critical exponent, namely the percolation strength , by use of the scaling assumption as suggested by the corresponding observables known from percolation theory. From the FSS of we obtained the critical exponent with a quality of the scaling assumption, see figure 5 table 3. In the formula above, the value of refers to the length of the largest loop found for a given realization of the disorder.
At criticality this reduces to .
Next, we consider the fractal (scaling) dimension of the loops defined via . The value of is bounded by the intrinsic dimension of a line and the topological dimension of the environment to . From scaling theory, we obtain the relation . This scaling relation may further be used to check for consistency as we employ two different methods to estimate critical exponents, i.e. a data collapse involving data at different values of and an analysis of the algebraic scaling of different observables right at the critical point. A simple fit to the power law data, shown in figure 6(a), yields the exponent with quality q_value (). This is compatible with the scaling relation within error bars, given the values deter minded above for and . Interestingly, the value of found here coincides with the fractal dimension of self avoiding walks on a regular lattice () and of exterior perimeters measured for percolation clusters at the percolation threshold freund1991 (). Moreover, it compares well with the value that describes the scaling of the average backbone perimeter with system size, measured for random percolation at the percolation threshold manna1989 (). This suggests, in analogy with the conclusions of manna1989 (), that negative weighted loops at belong to the same universality class as selfavoiding walks. The roughness of the loops is expected to display the critical scaling with a roughness exponent . The fit to the power law data, also shown in figure 6(a), yields indeed the exponent with quality , highlighting the selfsimilar nature of the loops.
The susceptibility like quantity , that measures the mean square fluctuation of the loop length, exhibits the critical scaling that allows to determine the critical exponent with a quality of the fit, see again figure 6(a). It is connected to the other exponents via the scaling relation , which is fulfilled within error bars.
Note that an analysis of the effective (local) exponents of the data belonging to , and yields the asymptotic scaling exponents , and compatible with the values found above but with somewhat larger errorbars, see figure 6(b).
As evident from figure 7, the distributions of the largest loops found for each realization of the disorder for different system sizes show a nice data collapse after a rescaling to the form . This means that not only the average but the full distribution scales with , again highlighting the fractal nature of the loops. Therein, the peak close to stems from the nonspanning loops and the peak close to stems from those that truly span the lattice along at least one direction. At the critical point, we further expect the distribution of all loop lengths , excluding loops with a spanning length , to exhibit an algebraic scaling , where signifies the Fisher exponent. The exponent characterizes the complete ensemble of loops and it is related to the fractal exponent of the loops via . Here, we found a value of , see inset of figure 7, in agreement with the latter scaling relation.
Iv Conclusions
In summary, we performed numerical simulations in order to probe the effect of dilution on the critical properties of NWP on lattice graphs. In this context and by means of exact combinatorial optimization algorithms we have investigated two different types of dilution. One type affecting the distribution of weights that are associated with the edges, the other type having an impact on the topology of the underlying lattice. We used observables from percolation theory and a FSS analysis so as to probe critical points along the critical lines in the disorderdilution plane that separate domains that allow/disallow system spanning, i.e. percolating, loops. We found that the first type of dilution does not change the universality class of NWP, i.e. the critical exponents are the same as for the undiluted model. The second type of dilution very well leads to a change of the universality class: As the disorder on the lattice increases, the critical exponent as well as the critical point of dilution approach the corresponding values known from usual random bond percolation, although the process, also due to its stringlike nature, is clearly different from standard percolation, also visible through the values of the other critical exponents. A more detailed analysis of the critical exponents for one particular critical point in the disorderdilution plane, i.e. , verified that the exponents are connected by the usual scaling relations. Moreover, the results for the scaling behavior of the percolating loops suggest that negative weighted loops at that particular critical point belong to the same universality class as selfavoiding walks.
Acknowledgements.
LA acknowledges a scholarship of the German academic exchange service DAAD within the “Research Internships in Science and Engineering” (RISE) program and the City College Fellowship program for further support. We further acknowledge financial support from the VolkswagenStiftung (Germany) within the program “Nachwuchsgruppen an Universitäten”. The simulations were performed at the “Gesellschaft für Wissenschaftliche Datenverarbeitung” in Göttingen (Germany), and the GOLEM I cluster for scientific computing at the University of Oldenburg (Germany).References
 [1] For the calculation of minimumweighted perfect matchings we use Cook and Rohes blossom4 extension to the Concorde library.
 [2] Krinner A. Bittner E. and Janke W. Vortexline percolation in the threedimensional complex ginzburglandau model. Phys. Rev. B, 72(9):094511, 2005.
 [3] Antunes N. D. and Bettencourt L. M. A. The Length Distribution of Vortex Strings in Equilibrium Scalar Field Theory. Phys. Rev. Lett., 81(15), 1998.
 [4] Stauffer D. Scaling theory of percolation clusters. Phys. Rep., 54(1):1–45, 1979.
 [5] Stauffer D. and Aharony A. Introduction to Percolation Theory. Taylor and Francis, 1994.
 [6] Freund H. and Grassberger P. Percolation and selfavoiding random loops. J. Phys. A: Mathematical and General, 24(7):L383–L387, 1991.
 [7] Hindmarsch H. and Strobl K. Statistical properties of strings. Nucl. Phys. B, 437:471, 1995.
 [8] Press W. H., Teukolsky S. A., Vetterling W. T., and Flannery B. P. Numerical Recipes in C, 1992. is the probability that the value of is worse than in the current fit, under the assumption that the fitted function in fact describes the data on average.
 [9] Engels J., Mashkevich S., Scheideler T., and Zinovjev G. Critical behavior of SU(2) lattice gauge theory. A complete analysis with the method. Phys. Lett. B, 365:219, 1996.
 [10] Houdayer J. and Hartmann A. K. Lowtemperature behavior of twodimensional Gaussian Ising spin glasses. Phys. Rev. B, 70:014418, 2004. measures the mean square distance of the scaled data to the master curve in units of standart errors.
 [11] Schakel A. M. J. Percolation, BoseEinstein condensation, and string proliferation. Phys. Rev. E, 63(2):026115, 2001.
 [12] Ahuja R. K., Magnanti T. L., and Orlin J. B. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
 [13] Hartmann A. K. and Rieger H. Optimization Algorithms in Physics. WileyVCH, Weinheim, 2001.
 [14] Schwartz N., Nazaryev A., and Havlin S. Optimal paths in two and three dimensions. Phys. Rev. E, 58:7642, 1998.
 [15] Melchert O. and Hartmann A. K. Fractal dimension of domain walls in twodimensional Ising spin glasses. Phys. Rev. B, 76(17), 2007.
 [16] Melchert O. and Hartmann A. K. Negativeweight percolation. New. J. Phys., 10:043039, 2008.
 [17] Pfeiffer F. O. and Rieger H. Critical properties of loop percolation models with optimization constraints. Phys. Rev. E, 67(5):056113, 2003.
 [18] Manna S. S. Structure of backbone perimeters of percolation clusters. Journal of Physics A: Mathematical and General, 22(4):433–440, 1989.
 [19] Wenzel S., Bittner E., Janke W., Schakel A. M. J., and Schiller A. Kertész Line in the ThreeDimensional Compact U(1) Lattice Higgs Model. Phys. Rev. Lett., 95(5):051601, 2005.
 [20] Cook W. and Rohe A. Computing minimumweight perfect matchings. INFORMS J. Computing, 11:138–148, 1999.