4.3 Article

Quasi-symmetries in complex networks: a dynamical model approach

期刊

JOURNAL OF COMPLEX NETWORKS
卷 9, 期 3, 页码 -

出版社

OXFORD UNIV PRESS
DOI: 10.1093/comnet/cnab025

关键词

complex networks; approximate symmetries; Kuramoto-Sakaguchi model; automorphism group orbits

向作者/读者索取更多资源

The paper discusses the concept of approximate symmetries in complex networks and introduces the idea of 'quasi-symmetries'. Analyzing quasi-symmetries can reveal hidden network attributes and provide insights on the complexity of network patterns, as well as the impact of quasi-symmetries on node centrality and community detection. The use of a 'dual-network' is proposed as a powerful tool to encode information about quasi-symmetries and obtain valuable insights about network structures.
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).

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据