Cantwell George T, Kirkley Alec, Radicchi Filippo
Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, New Mexico 87501, USA.
Department of Engineering, University of Cambridge, Cambridge CB2 1PZ, United Kingdom.
Phys Rev E. 2023 Sep;108(3-1):034310. doi: 10.1103/PhysRevE.108.034310.
Message passing (MP) is a computational technique used to find approximate solutions to a variety of problems defined on networks. MP approximations are generally accurate in locally treelike networks but require corrections to maintain their accuracy level in networks rich with short cycles. However, MP may already be computationally challenging on very large networks and additional costs incurred by correcting for cycles could be prohibitive. We show how the issue can be addressed. By allowing each node in the network to have its own level of approximation, one can focus on improving the accuracy of MP approaches in a targeted manner. We perform a systematic analysis of 109 real-world networks and show that our node-based MP approximation is able to increase both the accuracy and speed of traditional MP approaches. We find that, compared to conventional MP, a heterogeneous approach based on a simple heuristic is more accurate in 81% of tested networks, faster in 64% of cases, and both more accurate and faster in 49% of cases.
消息传递(MP)是一种计算技术,用于找到定义在网络上的各种问题的近似解。MP近似在局部树状网络中通常是准确的,但在富含短周期的网络中需要进行修正以维持其精度水平。然而,MP在非常大的网络上计算起来可能已经具有挑战性,并且通过修正周期产生的额外成本可能过高。我们展示了如何解决这个问题。通过允许网络中的每个节点具有自己的近似水平,人们可以有针对性地专注于提高MP方法的准确性。我们对109个真实世界的网络进行了系统分析,并表明我们基于节点的MP近似能够提高传统MP方法的准确性和速度。我们发现,与传统MP相比,基于简单启发式的异构方法在81%的测试网络中更准确,在64%的情况下更快,在49%的情况下既更准确又更快。