Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a network in which the probability for an edge between nodes $i$ and $j$ to be retained is proportional to $(k_ik_j)^{-α}$ with $k_i$ and $k_j$ the degrees of the nodes. We discuss two methods of network reconstruction, sequential and simultaneous, and investigate their properties by analytical and numerical means. The system is examined away from the percolation transition, where the size of the giant cluster is obtained, and close to the transition, where nonuniversal critical exponents are extracted using the generating functions method. The theory is found to agree quite well with simulations. By introducing an extension of the Fortuin-Kasteleyn construction, we find that biased percolation is well described by the $q\to 1$ limit of the $q$-state Potts model with inhomogeneous couplings.
The growth of two-dimensional lattice bond percolation clusters through a cooperative Achlioptas-type of process, where the choice of which bond to occupy next depends upon the masses of the clusters it connects, is shown to go through an explosive, first-order kinetic phase transition with a sharp jump in the mass of the largest cluster as the number of bonds is increased. The critical behavior of this growth model is shown to be of a different universality class than standard percolation.
We investigate the steady state of a two-dimensional random resistor network subjected to two competing biased percolations as a function of the bias strength. The properties of the linear and nonlinear regimes are studied by means of Monte Carlo simulations. In constant current conditions, a scaling relation is found between $<R>/<R>_0$ and $I/I_0$, where $<R>$ is the average network resistance, $<R>_0$ the Ohmic resistance and $I_0$ an appropriate threshold value for the onset of nonlinearity. A similar scaling relation is found also for the relative variance of resistance fluctuations. Thes…
The state of a 2-D random resistor network, resulting from the simultaneous evolutions of two competing biased percolations, is studied in a wide range of bias values. Monte Carlo simulations show that when the external current $I$ is below the threshold value for electrical breakdown, the network reaches a steady state with a nonlinear current-voltage characteristic. The properties of this nonlinear regime are investigated as a function of different model parameters. A scaling relation is found between $<R>/<R>_0$ and $I/I_0$, where $<R>$ is the average resistance, $<R>_0$ the linear regime r…
We reexamine the theory of transition from drift to no-drift in biased diffusion on percolation networks. We argue that for the bias field B equal to the critical value B_c, the average velocity at large times t decreases to zero as 1/log(t). For B < B_c, the time required to reach the steady-state velocity diverges as exp(const/|B_c-B|). We propose an extrapolation form that describes the behavior of average velocity as a function of time at intermediate time scales. This form is found to have a very good agreement with the results of extensive Monte Carlo simulations on a 3-dimensional site-…
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with probability proportional to (kq)^(-alpha…
We propose a numerical method to evaluate the upper critical dimension $d_c$ of random percolation clusters in Erdős-Rényi networks and in scale-free networks with degree distribution ${\cal P}(k) \sim k^{-λ}$, where $k$ is the degree of a node and $λ$ is the broadness of the degree distribution. Our results report the theoretical prediction, $d_c = 2(λ- 1)/(λ- 3)$ for scale-free networks with $3 < λ< 4$ and $d_c = 6$ for Erdős-Rényi networks and scale-free networks with $λ> 4$. When the removal of nodes is not random but targeted on removing the highest degree nodes we obtain $d_c = 6$ for al…
Percolation in a scale-free hierarchical network is solved exactly by renormalization-group theory, in terms of the different probabilities of short-range and long-range bonds. A phase of critical percolation, with algebraic (Berezinskii-Kosterlitz-Thouless) geometric order, occurs in the phase diagram, in addition to the ordinary (compact) percolating phase and the non-percolating phase. It is found that no connection exists between, on the one hand, the onset of this geometric BKT behavior and, on the other hand, the onsets of the highly clustered small-world character of the network and of …
The biased link occupation rule in the Achlioptas process (AP) discourages the large clusters to grow much ahead of others and encourages faster growth of clusters which lag behind. In this paper we propose a model where this tendency is sharply reflected in the Gamma distribution of the cluster sizes, unlike the power law distribution in AP. In this model single edges between pairs of clusters of sizes $s_i$ and $s_j$ are occupied with a probability $\propto (s_is_j)^α$. The parameter $α$ is continuously tunable over the entire real axis. Numerical studies indicate that for $α< α_c$ the trans…
We investigate the critical phenomena of the degree-ordered percolation (DOP) model on the hierarchical $(u,v)$ flower network. Using the renormalization-group like procedure, we derive the recursion relations for the percolating probability and the percolation order parameter, from which the percolation threshold and the critical exponents are obtained. When $u\neq 1$, the DOP critical behavior turns out to be identical to that of the bond percolation with a shifted nonzero percolation threshold. When $u=1$, the DOP and the bond percolation have the same vanishing percolation threshold but th…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the choice of each new link depends on the mass of the clusters that this link will merge. Networks constructed via this biased procedure show a percolation transition which strongly differs from the one observed in standard percolation, where links are introduced just randomly. The different growth process leads to a phase transition with a non-vanishing percola…
Recently the problem of classes of vulnerable vertices (represented by colors) in complex networks has been discussed, where all vertices with the same vulnerability are prone to fail together. Utilizing redundant paths each avoiding one vulnerability (color), a robust color-avoiding connectivity is possible. However, many infrastructure networks show the problem of vulnerable classes of \textit{edges} instead of vertices. Here we formulate color-avoiding percolation for colored edges as well. Additionally, we allow for random failures of vertices or edges. The interplay of random failures and…
In this work we investigate the spectra of Laplacian matrices that determine many dynamic properties of scale-free networks below and at the percolation threshold. We use a replica formalism to develop analytically, based on an integral equation, a systematic way to determine the ensemble averaged eigenvalue spectrum for a general type of tree-like networks. Close to the percolation threshold we find characteristic scaling functions for the density of states rho(lambda) of scale-free networks. rho(lambda) shows characteristic power laws rho(lambda) ~ lambda^alpha_1 or rho(lambda) ~ lambda^alph…
We investigate site percolation on a weighted planar stochastic lattice (WPSL) which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by percolation threshold $p_c$ and by a set of critical exponents $β$, $γ$, $ν$ which describe the critical behavior of percolation probability $P(p)\sim (p_c-p)^β$, mean cluster size $S\sim (p_c-p)^{-γ}$ and the correlation length $ξ\sim (p_c-p)^{-ν}$. Besides, the exponent $τ$ characterizes the cluster size distribution function $n_s(p_c)\sim s^{-τ}$ and the fractal dimension $d_f$ the spanning cluster. We obtain…
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that degree distribution is a key ingredient. The purpose of this paper is to show that power-law degree distribution itself is not sufficient to characterize the threshold of bond percolation in scale-free networks. To achieve this goal, we first propose a family of scale-free networks with the same degree sequence and obtain by analytical or numerical means sever…
We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size), assortative or disassortative (a measure of the tendency of like-degree nodes to be connected to one another), or possess various degrees of clustering. The percolation phase transition can be analyzed exactly in all these cases, due to the self-similar structure of the hierarchical nets. We find different types of criticality, illustrating the crucial effect of …
The nature of level set percolation in the two-dimension Gaussian Free Field has been an elusive question. Using a loop-model mapping, we show that there is a nontrivial percolation transition, and characterize the critical point. In particular, the correlation length diverges exponentially, and the critical clusters are "logarithmic fractals", whose area scales with the linear size as $A \sim L^2 / \sqrt{\ln L}$. The two-point connectivity also decays as the log of the distance. We corroborate our theory by numerical simulations. Possible CFT interpretations are discussed.
It has been recently shown that the percolation transition is discontinuous in Erdős-Rényi networks and square lattices in two dimensions under the Achlioptas Process (AP). Here, we show that when the structure is highly heterogeneous as in scale-free networks, a discontinuous transition does not always occur: a continuous transition is also possible depending on the degree distribution of the scale-free network. This originates from the competition between the AP that discourages the formation of a giant component and the existence of hubs that encourages it. We also estimate the value of the…
We discuss three related models of scale-free networks with the same degree distribution but different correlation properties. Starting from the Barabasi-Albert construction based on growth and preferential attachment we discuss two other networks emerging when randomizing it with respect to links or nodes. We point out that the Barabasi-Albert model displays dissortative behavior with respect to the nodes' degrees, while the node-randomized network shows assortative mixing. These kinds of correlations are visualized by discussig the shell structure of the networks around their arbitrary node.…
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the distribution of connected components. We determine the size of the percolation cluster above the percolation threshold. The conditional degree distribution on the percolation cluster is also given. We briefly present the analogous discussion for oriented graphs, giving for example the percolation criterion.
Percolation is one of the most studied processes in statistical physics. A recent paper by Achlioptas et al. [Science 323, 1453 (2009)] has shown that the percolation transition, which is usually continuous, becomes discontinuous ("explosive") if links are added to the system according to special cooperative rules (Achlioptas processes). In this paper we present a detailed numerical analysis of Achlioptas processes with product rule on various systems, including lattices, random networks a' la Erdoes-Renyi and scale-free networks. In all cases we recover the explosive transition by Achlioptas …
We study numerically the geometrical properties of minimally weighted paths that appear in the negative-weight percolation (NWP) model on two-dimensional lattices assuming a combination of periodic and free boundary conditions (BCs). Each realization of the disorder consists of a random fraction 1-rho of bonds with unit strength and a fraction rho of bond strengths drawn from a Gaussian distribution with zero mean and unit width. For each such sample, the path is forced to span the lattice along the direction with the free BCs. The path and a set of negatively weighted loops form a ground stat…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it exhibits threshold phenomena as we find sudden or abrupt jump in spanning probability across $p_c$ accompanied by the divergence of some other observable quantities which is reminiscent of continuous phase transition. Indeed, percolation is characterized by the critical behavior of percolation strength $P(p)\sim (p_c-p)^β$, mean cluster size $S\sim (p_c-p)^{-γ}$…
An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. {\bf 71}, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the bond percolation thresholds for networks of this type is examined and contrasted with some recent resu…
We study the evolution of percolation with freezing. Specifically, we consider cluster formation via two competing processes: irreversible aggregation and freezing. We find that when the freezing rate exceeds a certain threshold, the percolation transition is suppressed. Below this threshold, the system undergoes a series of percolation transitions with multiple giant clusters ("gels") formed. Giant clusters are not self-averaging as their total number and their sizes fluctuate from realization to realization. The size distribution F_k, of frozen clusters of size k, has a universal tail, F_k ~…
Percolation transition (PT) means the formation of a macroscopic-scale large cluster, which exhibits a continuous transition. However, when the growth of large clusters is globally suppressed, the type of PT is changed to a discontinuous transition for random networks. A question arises as to whether the type of PT is also changed for scale-free (SF) network, because the existence of hubs incites the formation of a giant cluster. Here, we apply a global suppression rule to the static model for SF networks, and investigate properties of the PT. We find that even for SF networks with the degree …
We investigate the geometric properties of percolation clusters, by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo simulations, we study the probability that a given edge is not a bridge but has both its loop arcs in the same loop, and find that it is governed by the two-arm exponent. We then classify bridges into two types: branches and junctions. A bridge is a {\em branch} iff at least one of the two clusters produced by its deletion is a tree. Starting from a percolation con…
In this article, we investigate explosive bond percolation (EBP) with product rule, formally known as Achlioptas process, on a scale-free multifractal weighted planar stochastic lattice (WPSL). One of the key features of the EBP transition is the delay, compared to corresponding random bond percolation (RBP), in the onset of spanning cluster. However, when it happens, it happens so dramatically that initially it was believed, albeit ultimately proved wrong, that explosive percolation (EP) exhibits first order transition. In the case of EP, much efforts were devoted to resolving the issue of it…
Sequence alignment is a tool in bioinformatics that is used to find homological relationships in large molecular databases. It can be mapped on the physical model of directed polymers in random media. We consider the finite-temperature version of local sequence alignment for proteins and study the transition between the linear phase and the biologically relevant logarithmic phase, where the free-energy grows linearly or logarithmically with the sequence length. By means of numerical simulations and finite-size scaling analysis we determine the phase diagram in the plane that is spanned by the …
The Gaussian free field (GFF) is considered in the background of random iso-height islands which is modeled by the site percolation with the occupation probability $p$. To realize GFF, we consider the Poisson equation in the presence of normal distributed white-noise charges, as the stationary state of the Edwards-Wilkinson (EW) model. The iso-potential (metallic in the terminology of the electrostatic problem) sites are chosen over the lattice according to the percolation problem, giving rise to some metallic islands and some active (not metallic, nor surrounded by a metallic island) area. We…
We show that negative of the number of floppy modes behaves as a free energy for both connectivity and rigidity percolation, and we illustrate this result using Bethe lattices. The rigidity transition on Bethe lattices is found to be first order at a bond concentration close to that predicted by Maxwell constraint counting. We calculate the probability of a bond being on the infinite cluster and also on the overconstrained part of the infinite cluster, and show how a specific heat can be defined as the second derivative of the free energy. We demonstrate that the Bethe lattice solution is equi…
Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the percolation process might present a bistability of the equilibrium solution. To this end, we introduce antagonistic interactions for which the functionality, or activity, of a node in a network is incompatible with the functionality, of the linked nodes in the other interacting networks. In particular, we study the percolation transition in two interacting networks …
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the same probability. However, alternative rules for the occupation of sites/bonds might affect the order of the transition. A recent set of rules proposed by Achlioptas et al. [Science 323, 1453 (2009)], characterized by competitive link addition, was claimed to lead to a discontinuous connectedness transition, named "explosive percolation". In this work we su…
In this paper we characterize the superconductor-insulator phase transition on a network of 2d percolation clusters. Sufficiently close to the percolation threshold, this network has a broad degree distribution, and at p=p_c the degree distribution becomes scale-free. We study the Transverse Ising Model on this complex topology in order to characterize the superconductor-insulator transition in a network formed by 2d percolation clusters of a superconductor material. We show, by a mean-field treatment, that the critical temperature of superconductivity depends on the maximal eigenvalue of the …
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation critical behaviors. Using the generating function method for bipartite networks, we analytically derive the percolation threshold and the order parameter critical exponent, $β$. For the MD scale-free networks, whose degree distribution is $P(k) \sim k^{-γ}$, we show that the exponent, $β$, for the MD networks and corresponding uncorrelated networks are same for …
We study critical bond percolation on a seven-dimensional (7D) hypercubic lattice with periodic boundary conditions and on the complete graph (CG) of finite volume $V$. We numerically confirm that for both cases, the critical number density $n(s,V)$ of clusters of size $s$ obeys a scaling form $n(s,V) \sim s^{-τ} \tilde{n} (s/V^{d^*_{\rm f}})$ with identical volume fractal dimension $d^*_{\rm f}=2/3$ and exponent $τ= 1+1/d^*_{\rm f}=5/2$. We then classify occupied bonds into {\em bridge} bonds, which includes {\em branch} and {\em junction} bonds, and {\em non-bridge} bonds; a bridge bond is a…
Disorder-free localization is a novel mechanism for ergodicity breaking which can occur in interacting quantum many-body systems such as lattice gauge theories (LGTs). While the nature of the quantum localization transition (QLT) is still debated for conventional many-body localization, here we provide the first comprehensive characterization of the QLT in two dimensions (2D) for a disorder-free case. Disorder-free localization can appear in homogeneous 2D LGTs such as the U(1) quantum link model (QLM) due to an underlying classical percolation transition fragmenting the system into disconnect…
Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by a line of first-order transitions whose location is determined exactly. This line ends at a critical point with classical critical exponents. Analytic expressions are given for the densities n_f of uncanceled degrees of freedom and gamma_r of redundant bonds. Upon crossing the coexistence line, n_f and gamma_r are continuous, although their first derivative…
In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erdős-Rényi networks, scale-free networks, and square lattice. In finite system, two well-defined Gaussian-like peaks coexist, and the valley between the two peaks is suppressed with the system size increasing. This finite-size effect always appears in typical first-order phase transition. However, both of the two peaks shift to zero point in a power law manner, which indicates the explosive percolation is continuou…
As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical Erdős-Rényi random networks with Poisson degree distribution, which are quite unlike many real-world networks with scale-free or fat-tailed degree distributions. Here we show that core percolation can be analytically studied for complex networks with arbitrary degree distributions. We derive the condition for core percolation and find that purely scale-free networks have no core f…
We study the statistical behavior under random sequential renormalization(RSR) of several network models including Erd"os R'enyi (ER) graphs, scale-free networks and an annealed model (AM) related to ER graphs. In RSR the network is locally coarse grained by choosing at each renormalization step a node at random and joining it to all its neighbors. Compared to previous (quasi-)parallel renormalization methods [C.Song et.al], RSR allows a more fine-grained analysis of the renormalization group (RG) flow, and unravels new features, that were not discussed in the previous analyses. In particular …
Understanding the causes and effects of spatial vegetation patterns is a fundamental problem in ecology, especially because these can be used as early predictors of catastrophic shifts such as desertification processes. Empirical studies of the vegetation cover in some areas such as drylands and semiarid regions have revealed the existence of vegetation patches of broadly diverse sizes. In particular, the probability distribution of patch sizes can be fitted by a power law, i.e. vegetation patches are approximately scale free up to some maximum size. Different explanatory mechanisms, such as p…
We investigate the influence of sub-Ohmic dissipation on randomly diluted quantum Ising and rotor models. The dissipation causes the quantum dynamics of sufficiently large percolation clusters to freeze completely. As a result, the zero-temperature quantum phase transition across the lattice percolation threshold separates an unusual super-paramagnetic cluster phase from an inhomogeneous ferromagnetic phase. We determine the low-temperature thermodynamic behavior in both phases which is dominated by large frozen and slowly fluctuating percolation clusters. We relate our results to the smeared …
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system. Percolation has always been regarded as a substrate-dependent but model-independent process, in the sense that the critical exponents of the transition are determined by the geometry of the system, but they are identical for the bond and site percolation models. Here, we report a violation of such assumption. We provide analytical and numerical evidence of a d…
As a dynamical complex system, traffic is characterized by a transition from free flow to congestions, which is mostly studied in highways. However, despite its importance in developing congestion mitigation strategies, the understanding of this common traffic phenomenon in a city-scale is still missing. An open question is how the traffic in the network collapses from a global efficient traffic to isolated local flows in small clusters, i.e. the question of traffic percolation. Here we study the traffic percolation properties on a lattice by simulation of an agent-based model for traffic. A c…
