arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.13646cs.SIcs.GR
收藏

多局部维数复杂网络中重要扩散子的识别

Vital Spreaders Identification in Complex Networks with Multi-Local Dimension

Tao Wen, Danilo Pelusi, Yong Deng

摘要:

重要节点的识别一直是该问题的研究热点。针对这一问题,人们提出了多种中心性度量方法,但大多数方法都有其局限性。为了更有效地解决这一问题,本文提出了一种基于分形特性的多局部维数(MLD)来识别重要传播者。所提出的方法考虑包含在盒子中的信息,并且$q$为该分区信息起加权系数的作用。不同$q$值的MLD有不同的表达式,当$q = 1$和$q = 0$分别退化为局部信息维和局部维的变体,这两种方法都是识别影响节点的有效方法。因此,MLD将是一个更一般的方法,可以退化到一些现有的中心性措施。此外,与经典方法不同的是,具有低MLD的节点将在网络中更重要。本文通过比较方法和实际复杂网络的计算结果验证了该方法的有效性和合理性。实验结果表明了该方法的优越性。

英文摘要:

The important nodes identification has been an interesting problem in this issue. Several centrality measures have been proposed to solve this problem, but most of previous methods have their own limitations. To address this problem more effectively, multi-local dimension (MLD) which is based on the fractal property is proposed to identify the vital spreaders in this paper. This proposed method considers the information contained in the box and $q$ plays a weighting coefficient for this partition information. MLD would have different expressions with different value of $q$, and it would degenerate to local information dimension and variant of local dimension when $q = 1$ when $q = 0$ respectively, both of which have been effective identification method for influential nodes. Thus, MLD would be a more general method which can degenerate to some exiting centrality measures. In addition, different with classical methods, the node with low MLD would be more important in the network. Some comparison methods and real-world complex networks are applied in this paper to show the effectiveness and reasonableness of this proposed method. The experiment results show the superiority of this proposed method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑