当前位置: X-MOL 学术Phys. Rev. E › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Structure of percolating clusters in random clustered networks.
Physical Review E ( IF 2.2 ) Pub Date : 2020-06-22 , DOI: 10.1103/physreve.101.062310
Takehisa Hasegawa 1 , Shogo Mizutaka 1
Affiliation  

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.

中文翻译:

随机集群网络中渗流集群的结构。

我们检查由随机集群网络(RCN)模型上的站点渗透形成的渗透集群(PC)的结构。使用生成函数,我们可以计算出PC的聚类系数和分类系数。我们通过分析和数值分析表明,即使在渗透阈值下,高度群集网络中的PC也会群集。PC的分类取决于RCN的详细信息。当每个节点的边缘和三角形的数量由泊松分布分配时,处于渗滤阈值的PC是可分解的,但是当RCN中的每个节点具有相同数量的少量边缘(大多数都形成三角形)时,PC是可分解的。尽管重新规范化方案揭示了分形PC的可分解性,但该结果似乎与分形网络的可分解性相矛盾。
更新日期:2020-06-22
down
wechat
bug