arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.18170cond-mat.dis-nncond-mat.stat-mechphysics.soc-ph
收藏

随机超几何图的统计力学:在费米最大熵框架内

Statistical Mechanics of Random Hyperbolic Graphs within the Fermionic Maximum-Entropy Framework

Universitat de Barcelona(巴塞罗那大学);Institució Catalana de Recerca i Estudis Avançats (ICREA)(加泰罗尼亚高级研究学院)

M. Ángeles Serrano

AI总结:

本文基于超几何网络模型,探讨其在复杂网络统计力学中的应用,通过最大熵原理建立费米粒子模型,揭示网络结构的自组织特性与相变行为。

摘要:

自然和人造系统中元素间的复杂关系塑造了我们的世界,形成多尺度交互网络。这些网络可表示为由节点和链接构成的图,无论领域如何,它们共享一组基本结构属性。超几何空间中的网络模型是描述这些属性最先进的框架之一,包括稀疏性、小世界特性、异质性和层次组织、高聚类性和网络重整化变换下的尺度不变性。这些几何模型还表现出其他有趣现象,如几何与非几何相之间的异常温度依赖相变。在简单的图表示中,网络链接无权,模型可通过最大化图集合的吉布斯熵,在受观测约束下推导出。在本文综述中,我回顾了这些推导并补充了不同来源的内容,以正确地将超几何随机图置于复杂网络统计力学的最大熵原理广阔框架中。本文的方法代表了对基本网络属性集的最无偏预测,并为分析网络结构建立了原理性框架,为理论和实证研究提供了新的视角和强大的分析工具。

英文摘要:

The intricate relations between elements in natural and human-made systems sustain the complex processes that shape our world, forming multiscale networks of interactions. These networks can be represented as graphs composed of nodes connected by links and, regardless of their domain, they share a set of fundamental structural properties. The family of network models in hyperbolic space constitutes one of the most advanced frameworks accounting for such properties, including sparsity, the small-world property, heterogeneity and hierarchical organization, high clustering, and scale invariance under network renormalization transformations. These geometric models also exhibit other intriguing phenomena, such as an anomalous, temperature-dependent phase transition between a geometric and a non-geometric phase. In simple graph representations, where network links are unweighted, the model can be derived within a statistical-mechanics framework by maximizing the Gibbs entropy of the graph ensemble subject to constraints imposed by observations, with links effectively behaving as fermionic particles. In this topical review, I revisit these derivations previously scattered across different sources and complement them, in order to properly contextualize and consolidate hyperbolic random graphs within the broad framework of the maximum-entropy principle in the statistical mechanics of complex networks. The approach presented here represents the least-biased prediction of the fundamental set of core network properties and establishes a principled framework for analyzing network structure, offering new perspectives and powerful analytical tools for both theoretical and empirical studies.

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

↑