Belief propagation for finite networks using a symmetry-breaking source node
Seongmin Kim and Alec Kirkley
信念传播(BP)是一种高效的消息传递算法,广泛用于在图形模型中推理和解决统计物理学中的各种问题。 然而,BP经常在有限系统中产生对订单参数及其易感性的不准确估计,特别是在很少循环的稀疏网络中。 在这里,我们展示了渗透和Ising模型,这些模型可以修复单个连接良好的“源”节点的状态,以打破全局对称性,大大提高了推理精度,并在广泛的网络中捕获有限大小的效应,特别是类似树的网络,无需额外的计算成本。
Belief Propagation (BP) is an efficient message-passing algorithm widely used for inference in graphical models and for solving various problems in statistical physics. However, BP often yields inaccurate estimates of order parameters and their susceptibilities in finite systems, particularly in sparse networks with few loops. Here, we show for both percolation and Ising models that fixing the state of a single well-connected "source" node to break global symmetry substantially improves inferenc...