arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.03650physics.soc-phcs.SI
收藏

复杂网络的高阶重介性

Higher order assortativity in complex networks

Alberto Arcagni, Rosanna Grassi, Silvana Stefani, Anna Torriero

摘要:

分类性首先由Newman提出,并从那时起被广泛研究并应用于许多现实世界的网络系统。集合度是一个图的度量,描述了高度节点直接连接到高度节点和低度节点直接连接到低度节点的趋势。它可以被解释为节点之间连接的一阶度量,即度-度向量的第一自相关。尽管非对称性被如此广泛地使用,但据作者所知,没有人试图在理论上对其进行扩展。这就是我们论文的范围。我们将通过基于驱动连接的矩阵的适当选择来扩展Newman指数来引入高阶介电性。高阶重传率将被定义为路径,最短路径,给定时间长度的随机行走,连接任何节点对。当矩阵是邻接矩阵时,或者换句话说,相关性是1阶时,这些测量中的每一个都实现了纽曼相关性。我们提出的高阶拓扑指数可以用来描述各种真实网络,有助于区分具有相同Newman指数的网络,并可能揭示新的拓扑网络特征。

英文摘要:

Assortativity was first introduced by Newman and has been extensively studied and applied to many real world networked systems since then. Assortativity is a graph metrics and describes the tendency of high degree nodes to be directly connected to high degree nodes and low degree nodes to low degree nodes. It can be interpreted as a first order measure of the connection between nodes, i.e. the first autocorrelation of the degree-degree vector. Even though assortativity has been used so extensively, to the author's knowledge, no attempt has been made to extend it theoretically. This is the scope of our paper. We will introduce higher order assortativity by extending the Newman index based on a suitable choice of the matrix driving the connections. Higher order assortativity will be defined for paths, shortest paths, random walks of a given time length, connecting any couple of nodes. The Newman assortativity is achieved for each of these measures when the matrix is the adjacency matrix, or, in other words, the correlation is of order 1. Our higher order assortativity indexes can be used for describing a variety of real networks, help discriminating networks having the same Newman index and may reveal new topological network features.

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

↑