Message passing on networks with loops

DOI10.1073/pnas.1914893116zbMath1431.94214arXiv1907.08252OpenAlexW2963092996WikidataQ91104834 ScholiaQ91104834MaRDI QIDQ5218487

George T. Cantwell, M. E. J. Newman

Publication date: 4 March 2020

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.08252

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Uncovering the non-equilibrium stationary properties in sparse Boolean networks ⋮ Targeted influence maximization in complex networks ⋮ The characteristics of cycle-nodes-ratio and its application to network classification ⋮ Message-passing theory for cooperative epidemics ⋮ Coordination problems on networks revisited: statics and dynamics ⋮ On forest expansions for two-body partition functions on tree-like interaction graphs

This page was built for publication: Message passing on networks with loops