arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.06257physics.soc-phcond-mat.stat-mechcs.SImath-phmath.MP
收藏

具有复权重的复杂网络

Complex networks with complex weights

Lucas Böttcher, Mason A. Porter

AI总结:

本文研究具有复权重的复杂网络,指出标准网络分析方法在复权重下的不足,并将多种网络测度推广到复域,提出随机游走中心性可有效评估节点重要性。

摘要:

在许多研究中,通常使用二元(即无权)边来考察实体之间要么相邻要么不相邻的网络。研究者已将此类二元网络推广为包含边权重,从而能够编码具有异质强度或频率的节点间相互作用(例如在交通网络、供应链和社交网络中)。大多数此类研究考虑的是实值权重,尽管具有复权重的网络出现在量子信息、量子化学、电动力学、流变学和机器学习等多个不同领域。经典系统研究中许多标准的网络科学方法依赖于边权重的实值性质,因此如果希望用它们来分析具有复边权重的网络,就必须对其进行推广。在本文中,我们考察了标准网络分析方法如何无法捕捉具有复边权重网络的结构特征。随后,我们将若干网络测度推广到复域,并表明随机游走中心性为考察具有复权重网络中节点重要性提供了一种有用的方法。

英文摘要:

In many studies, it is common to use binary (i.e., unweighted) edges to examine networks of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to encode node--node interactions with heterogeneous intensities or frequencies (e.g., in transportation networks, supply chains, and social networks). Most such studies have considered real-valued weights, despite the fact that networks with complex weights arise in fields as diverse as quantum information, quantum chemistry, electrodynamics, rheology, and machine learning. Many of the standard network-science approaches in the study of classical systems rely on the real-valued nature of edge weights, so it is necessary to generalize them if one seeks to use them to analyze networks with complex edge weights. In this paper, we examine how standard network-analysis methods fail to capture structural features of networks with complex edge weights. We then generalize several network measures to the complex domain and show that random-walk centralities provide a useful approach to examine node importances in networks with complex weights.

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

↑