اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDifferent thresholds of bond percolation in scale-free networks with identical degree sequence
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 several topological features of the networks. Then, by making use of the renormalization group technique we determine the threshold of bond percolation in our networks. We find an existence of non-zero thresholds and demonstrate that these thresholds can be quite different, which implies that power-law degree distribution does not suffice to characterize the percolation threshold in scale-free networks.
قيم البحث
اقرأ أيضاً
The studies based on $A+A rightarrow emptyset$ and $A+Brightarrow emptyset$ diffusion-annihilation processes have so far been studied on weighted uncorrelated scale-free networks and fractal scale-free networks. In the previous reports, it is widely
accepted that the segregation of particles in the processes is introduced by the fractal structure. In this paper, we study these processes on a family of weighted scale-free networks with identical degree sequence. We find that the depletion zone and segregation are essentially caused by the disassortative mixing, namely, high-degree nodes tend to connect with low-degree nodes. Their influence on the processes is governed by the correlation between the weight and degree. Our finding suggests both the weight and degree distribution dont suffice to characterize the diffusion-annihilation processes on weighted scale-free networks.
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.
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 wh
ich the probability for an edge between nodes $i$ and $j$ to be retained is proportional to $(k_ik_j)^{-alpha}$ 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 $qto 1$ limit of the $q$-state Potts model with inhomogeneous couplings.
We determine thresholds $p_c$ for random site percolation on a triangular lattice for neighbourhoods containing nearest (NN), next-nearest (2NN), next-next-nearest (3NN), next-next-next-nearest (4NN) and next-next-next-next-nearest (5NN) neighbours,
and their combinations forming regular hexagons (3NN+2NN+NN, 5NN+4NN+NN, 5NN+4NN+3NN+2NN, 5NN+4NN+3NN+2NN+NN). We use a fast Monte Carlo algorithm, by Newman and Ziff [M. E. J. Newman and R. M. Ziff, Physical Review E 64, 016706 (2001)], for obtaining the dependence of the largest cluster size on occupation probability. The method is combined with a method, by Bastas et al. [N. Bastas, K. Kosmidis, P. Giazitzidis, and M. Maragakis, Physical Review E 90, 062101 (2014)], of estimating thresholds from low statistics data. The estimated values of percolation thresholds are $p_c(text{4NN})=0.192410(43)$, $p_c(text{3NN+2NN})=0.232008(38)$, $p_c(text{5NN+4NN})=0.140286(5)$, $p_c(text{3NN+2NN+NN})=0.215484(19)$, $p_c(text{5NN+4NN+NN})=0.131792(58)$, $p_c(text{5NN+4NN+3NN+2NN})=0.117579(41)$, $p_c(text{5NN+4NN+3NN+2NN+NN})=0.115847(21)$. The method is tested on the standard case of site percolation on triangular lattice, where $p_c(text{NN})=p_c(text{2NN})=p_c(text{3NN})=p_c(text{5NN})=frac{1}{2}$ is recovered with five digits accuracy $p_c(text{NN})=0.500029(46)$ by averaging over one thousand lattice realisations only.
We present some exact results on bond percolation. We derive a relation that specifies the consequences for bond percolation quantities of replacing each bond of a lattice $Lambda$ by $ell$ bonds connecting the same adjacent vertices, thereby yieldin
g the lattice $Lambda_ell$. This relation is used to calculate the bond percolation threshold on $Lambda_ell$. We show that this bond inflation leaves the universality class of the percolation transition invariant on a lattice of dimensionality $d ge 2$ but changes it on a one-dimensional lattice and quasi-one-dimensional infinite-length strips. We also present analytic expressions for the average cluster number per vertex and correlation length for the bond percolation problem on the $N to infty$ limits of several families of $N$-vertex graphs. Finally, we explore the effect of bond vacancies on families of graphs with the property of bounded diameter as $N to infty$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
