多尺度网络重整化:无几何下的尺度不变性
Multiscale network renormalization: scale-invariance without geometry
AI总结:
针对复杂网络因小世界特性和无几何嵌入难以用常规重整化方法处理的问题,提出适用于任意异质粗粒化层级的无几何图重整化方案,识别出尺度不变网络的特征,还推导了国际贸易网络的精确多尺度模型,明确了无标度与尺度不变网络的概念差异。
摘要:
具有晶格几何结构的系统可利用其在度量空间中的坐标进行重整化,这些坐标自然定义了粗粒化节点。相比之下,复杂网络由于其小世界特性且缺乏明确的几何嵌入,无法适用常规技术。当前的网络重整化方法需要强假设(例如社区结构、双曲性、无标度拓扑),因此无法兼容通用图和普通晶格。本文提出了一种适用于任意层级异质粗粒化的图重整化方案,从而能够跨多个尺度定义“块节点”。该方法识别出一类尺度不变网络,其特征是对节点附带的加性隐藏变量存在必要且特定的依赖,此外还包含可选的二元因子。若隐藏变量是退火的,即使在稀疏区域且无几何结构的情况下,也能生成具有同配性和有限局部聚类的真实无标度网络。若隐藏变量是淬火的,它们可指导具有节点属性、距离依赖性或社区结构的真实世界网络的重整化。作为应用,我们推导了一个适用于任意地理分区的国际贸易网络(International Trade Network)的精确多尺度模型。这些结果凸显了无标度网络与尺度不变网络之间深刻的概念差异,并提供了一条无需几何的重整化路径。
英文摘要:
Systems with lattice geometry can be renormalized exploiting their coordinates in metric space, which naturally define the coarse-grained nodes. By contrast, complex networks defy the usual techniques, due to their small-world character and lack of explicit geometric embedding. Current network renormalization approaches require strong assumptions (e.g. community structure, hyperbolicity, scale-free topology), thus remaining incompatible with generic graphs and ordinary lattices. Here we introduce a graph renormalization scheme valid for any hierarchy of heterogeneous coarse-grainings, thereby allowing for the definition of 'block-nodes' across multiple scales. This approach identifies a class of scale-invariant networks characterized by a necessary and specific dependence on additive hidden variables attached to nodes, plus optional dyadic factors. If the hidden variables are annealed, they lead to realistic scale-free networks with assortativity and finite local clustering, even in the sparse regime and in absence of geometry. If they are quenched, they can guide the renormalization of real-world networks with node attributes and distance-dependence or communities. As an application, we derive an accurate multiscale model of the International Trade Network applicable across arbitrary geographic partitions. These results highlight a deep conceptual distinction between scale-free and scale-invariant networks, and provide a geometry-free route to renormalization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。