arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.17440nlin.PS
收藏

聚类对复杂网络中图灵不稳定性的影响

Effect of clustering on Turing instability in complex networks

Samana Pranesh, Devanand Jaiswal, Sayan Gupta

AI总结:

本文研究复杂网络中节点聚类对图灵不稳定性的影响,发现除平均度外聚类也是关键因素,并通过解析与数值结果在双曲几何网络、随机网络和无标度网络中验证了其重要性。

摘要:

文献表明,复杂网络中的图灵不稳定性主要由节点度分布主导。图灵不稳定性的条件已被推导出,并明确依赖于拉普拉斯算子的特征值,而后者又依赖于网络拓扑。本研究揭示,除了网络的平均度之外,另一个全局网络度量——节点聚类——也起着关键作用。文中给出了解析和数值结果,以展示聚类在多种网络拓扑中的重要性,这些拓扑包括能够对现实世界网络中自然出现的聚类进行建模的 $\mathbb{S}^1$ / $\mathbb{H}^2$ 双曲几何网络,以及作为 $\mathbb{S}^1$ / $\mathbb{H}^2$ 模型极限情形得到的随机网络和无标度网络。对这些网络中特征向量局域化性质的分析显示出独特的特征,使得即使在复杂网络中也能识别所谓的图灵斑图。

英文摘要:

Turing instability in complex networks have been shown in the literature to be dominated by the distribution of the nodal degrees. The conditions for Turing instability have been derived with an explicit dependence on the eigenvalues of the Laplacian, which in turn depends on the network topology. This study reveals that apart from average degree of the network, another global network measure - the nodal clustering - also plays a crucial role. Analytical and numerical results are presented to show the importance of clustering for several network topologies ranging from the $\mathbb{S}^1$ / $\mathbb{H}^2$ hyperbolic geometric networks that enable modelling the naturally occurring clustering in real world networks, as well as the random and scale free networks, which are obtained as limiting cases of the $\mathbb{S}^1$ / $\mathbb{H}^2$ model. Analysis of eigenvector localization properties in these networks are shown to reveal distinct signatures that enable identifying the so called Turing patterns even in complex networks.

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

↑