复杂网络中的准对称性:一种动力学模型方法
Quasi-symmetries in complex networks: a dynamical model approach
摘要:
复杂网络中对称性的存在对网络的动力学行为有着重要的影响。然而,除了拓扑对称性之外,我们还应该考虑到现实世界的网络会受到波动或错误的影响,以及错误的插入或删除。因此,得到的近似对称性仍然隐藏在标准对称性分析中-完全由离散代数软件完成。已经有许多尝试来处理近似对称性。在目前的工作中,我们提供了一个替代的概念,这些较弱的对称性,我们称之为“准对称性”。与其他定义不同的是,准对称性仍然可以自由地施加任何特定网络属性的不变性,并且它们可以从振荡动力学模型(Kuramoto-Sakaguchi模型)的稳态配置处的相位差中获得。准对称性的分析揭示了现实世界网络中隐藏的属性。一方面,我们提供了一个基准,以确定是否有一个更复杂的模式比随机网络的准对称性,即,如果它被构造成单独的准对称组的节点。另一方面,我们定义了“双重网络”,一个加权网络(及其相应的二进制化对应),有效地编码原始网络中的所有准对称信息。后者是一个强大的工具,用于获得有价值的见解关于节点中心性(获得的节点是唯一的,作为模仿者相对于其他)和社区检测(准对称组的节点)。
英文摘要:
The existence of symmetries in complex networks has a significant effect on network dynamic behaviour. Nevertheless, beyond topological symmetry, one should consider the fact that real-world networks are exposed to fluctuations or errors, as well as mistaken insertions or removals. Therefore, the resulting approximate symmetries remain hidden to standard symmetry analysis - fully accomplished by discrete algebra software. There have been a number of attempts to deal with approximate symmetries. In the present work we provide an alternative notion of these weaker symmetries, which we call `quasi-symmetries'. Differently from other definitions, quasi-symmetries remain free to impose any invariance of a particular network property and they are obtained from the phase differences at the steady-state configuration of an oscillatory dynamical model: the Kuramoto-Sakaguchi model. The analysis of quasi-symmetries unveils otherwise hidden real-world networks attributes. On the one hand, we provide a benchmark to determine whether a network has a more complex pattern than that of a random network with regard to quasi-symmetries, namely, if it is structured into separate quasi-symmetric groups of nodes. On the other hand, we define the `dual-network', a weighted network (and its corresponding binnarized counterpart) that effectively encodes all the information of quasi-symmetries in the original network. The latter is a powerful instrument for obtaining worthwhile insights about node centrality (obtaining the nodes that are unique from that act as imitators with respect to the others) and community detection ( quasi-symmetric groups of nodes).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。