اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPercolation on correlated networks
181
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for degree-degree correlations to be irrelevant for critical singularities. We present examples of networks in which assortative and disassortative mixing leads to unusual percolation properties and new critical exponents.
قيم البحث
اقرأ أيضاً
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 ErdH{o}s-Renyi random networks wi
th 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 for any degree exponents. We show that for undirected networks if core percolation occurs then it is always continuous while for directed networks it becomes discontinuous when the in- and out-degree distributions are different. We also apply our theory to real-world directed networks and find, surprisingly, that they often have much larger core sizes as compared to random models. These findings would help us better understand the interesting interplay between the structural and dynamical properties of complex networks.
In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths could be di
fferent between different nodes. We find that the heterogeneous dependency strength will make the system more robust, and for various distributions of dependency strengths both continuous and discontinuous percolation transitions can be found. For ErdH{o}s-R{e}nyi networks, we prove that the crossing point of the continuous and discontinuous percolation transitions is dependent on the first five moments of the dependency strength distribution. This indicates that the discontinuous percolation transition on networks with dependency is determined not only by the dependency strength but also by its distribution. Furthermore, in the area of the continuous percolation transition, we also find that the critical point depends on the first and second moments of the dependency strength distribution. To validate the theoretical analysis, cases with two different dependency strengths and Gaussian distribution of dependency strengths are presented as examples.
Cluster concepts have been extremely useful in elucidating many problems in physics. Percolation theory provides a generic framework to study the behavior of the cluster distribution. In most cases the theory predicts a geometrical transition at the
percolation threshold, characterized in the percolative phase by the presence of a spanning cluster, which becomes infinite in the thermodynamic limit. Standard percolation usually deals with the problem when the constitutive elements of the clusters are randomly distributed. However correlations cannot always be neglected. In this case correlated percolation is the appropriate theory to study such systems. The origin of correlated percolation could be dated back to 1937 when Mayer [1] proposed a theory to describe the condensation from a gas to a liquid in terms of mathematical clusters (for a review of cluster theory in simple fluids see [2]). The location for the divergence of the size of these clusters was interpreted as the condensation transition from a gas to a liquid. One of the major drawback of the theory was that the cluster number for some values of thermodynamic parameters could become negative. As a consequence the clusters did not have any physical interpretation [3]. This theory was followed by Frenkels phenomenological model [4], in which the fluid was considered as made of non interacting physical clusters with a given free energy. This model was later improved by Fisher [3], who proposed a different free energy for the clusters, now called droplets, and consequently a different scaling form for the droplet size distribution. This distribution, which depends on two geometrical parameters, has the nice feature that the mean droplet size exhibits a divergence at the liquid-gas critical point.
Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to neighboring empt
y sites at rate $p$, and predator particles spread only to neighboring sites occupied by prey particles at rate $1$, killing the prey particle that existed at that site. It was found that the prey can survive with non-zero probability, if $p>p_c$ with $p_c<1$. Using Monte Carlo simulations on the square lattice, we estimate the value of $p_c = 0.49451 pm 0.00001$, and the critical exponents are consistent with the undirected percolation universality class. We define a discrete-time parallel-update version of the model, which brings out the relation between chase-escape and undirected bond percolation. For all $p < p_c$ in $D$-dimensions, the number of predators in the absorbing configuration has a stretched-exponential distribution in contrast to the exponential distribution in the standard percolation theory. We also study the problem starting from the line initial condition with predator particles on all lattice points of the line $y=0$ and prey particles on the line $y=1$. In this case, for $p_c<p < 1$, the center of mass of the fluctuating prey and predator fronts travel at the same speed. This speed is strictly smaller than the speed of an Eden front with the same value of $p$, but with no predators. At $p=1$, the fronts undergo a depinning transition. The fluctuations of the front follow Kardar-Parisi-Zhang scaling both above and below this depinning transition.
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), where alpha is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin-Kasteleyn construction which provides a link between our model and a limit of the Potts model.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
