اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStructure of percolating clusters in random clustered networks
114
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We examine the structure of the percolating cluster (PC) formed by site percolation on a random clustered network (RCN) model. Using the generating functions, we formulate the clustering coefficient and assortative coefficient of the PC. We analytically and numerically show that the PC in the highly clustered networks is clustered even at the percolation threshold. The assortativity of the PC depends on the details of the RCN. The PC at the percolation threshold is disassortative when the numbers of edges and triangles of each node are assigned by Poisson distributions, but assortative when each node in an RCN has the same small number of edges, most of which form triangles. This result seemingly contradicts the disassortativity of fractal networks, although the renormalization scheme unveils the disassortative nature of a fractal PC.
قيم البحث
اقرأ أيضاً
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the assortativity of a g
iant component, $r$, which is defined as Pearsons correlation coefficient for degrees of directly connected nodes. For uncorrelated random networks in which the third moment for the degree distribution is finite, we prove the following two points. (1) Assortativity $r$ satisfies the relation $rle 0$ for $pge p_{rm c}$. (2) The average degree of nodes adjacent to degree-$k$ nodes at the percolation threshold is proportional to $k^{-1}$ independently of the degree distribution function. These results claim that disassortativity emerges in giant components near the percolation threshold. The accuracy of the analytical treatment is confirmed by extensive Monte Carlo simulations.
We investigate the effect of clustering on network observability transitions. In the observability model introduced by Yang, Wang, and Motter [Phys. Rev. Lett. 109, 258701 (2012)], a given fraction of nodes are chosen randomly, and they and those nei
ghbors are considered to be observable, while the other nodes are unobservable. For the observability model on random clustered networks, we derive the normalized sizes of the largest observable component (LOC) and largest unobservable component (LUC). Considering the case where the numbers of edges and triangles of each node are given by the Poisson distribution, we find that both LOC and LUC are affected by the networks clustering: more highly-clustered networks have lower critical node fractions for forming macroscopic LOC and LUC, but this effect is small, becoming almost negligible unless the average degree is small. We also evaluate bounds for these critical points to confirm clusterings weak or negligible effect on the network observability transition. The accuracy of our analytical treatment is confirmed by Monte Carlo simulations.
In recent years, the theory and application of complex networks have been quickly developing in a markable way due to the increasing amount of data from real systems and to the fruitful application of powerful methods used in statistical physics. Man
y important characteristics of social or biological systems can be described by the study of their underlying structure of interactions. Hierarchy is one of these features that can be formulated in the language of networks. In this paper we present some (qualitative) analytic results on the hierarchical properties of random network models with zero correlations and also investigate, mainly numerically, the effects of different type of correlations. The behavior of hierarchy is different in the absence and the presence of the giant components. We show that the hierarchical structure can be drastically different if there are one-point correlations in the network. We also show numerical results suggesting that hierarchy does not change monotonously with the correlations and there is an optimal level of non-zero correlations maximizing the level of hierarchy.
We perform an analytical analysis of the long-range degree correlation of the giant component in an uncorrelated random network by employing generating functions. By introducing a characteristic length, we find that a pair of nodes in the giant compo
nent is negatively degree-correlated within the characteristic length and uncorrelated otherwise. At the critical point, where the giant component becomes fractal, the characteristic length diverges and the negative long-range degree correlation emerges. We further propose a correlation function for degrees of the $l$-distant node pairs, which behaves as an exponentially decreasing function of distance in the off-critical region. The correlation function obeys a power-law with an exponential cutoff near the critical point. The ErdH{o}s-R{e}nyi random graph is employed to confirm this critical behavior.
Multilayer networks are widespread in natural and manmade systems. Key properties of these networks are their spectral and eigenfunction characteristics, as they determine the critical properties of many dynamics occurring on top of them. In this pap
er, we numerically demonstrate that the normalized localization length $beta$ of the eigenfunctions of multilayer random networks follows a simple scaling law given by $beta=x^*/(1+x^*)$, with $x^*=gamma(b_{text{eff}}^2/L)^delta$, $gamma,deltasim 1$ and $b_{text{eff}}$ being the effective bandwidth of the adjacency matrix of the network, whose size is $L=Mtimes N$. The reported scaling law for $beta$ might help to better understand criticality in multilayer networks as well as to predict the eigenfunction localization properties of them.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
