复杂网络与对称性I
Complex Networks and Symmetry I: A Review
摘要:
在这篇综述中,我们建立了复杂网络和对称性之间的各种联系。而特殊类型的对称(例如,自同构)在离散数学中详细研究了特定类别的确定性图,但对真实复杂网络中更一般的对称性的分析远未得到发展。我们认为,真正的网络,作为任何实体的特点是不完美或错误,必然需要一个随机概念的不变性。因此,我们提出了一个基于图系综的随机对称性的定义,并用它来审查网络理论的主要成果从一个不寻常的角度。这里讨论的结果,并在配套文件表明,随机对称性突出了最翔实的拓扑性质的真实网络,即使在嘈杂的情况下无法访问的确切技术。
英文摘要:
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs, the analysis of more general symmetries in real complex networks is far less developed. We argue that real networks, as any entity characterized by imperfections or errors, necessarily require a stochastic notion of invariance. We therefore propose a definition of stochastic symmetry based on graph ensembles and use it to review the main results of network theory from an unusual perspective. The results discussed here and in a companion paper show that stochastic symmetry highlights the most informative topological properties of real networks, even in noisy situations unaccessible to exact techniques.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。