Community Detection as an Inference Problem
M. B. Hastings
Abstract
We express community detection as an inference problem of determining the most likely arrangement of communities. We then apply belief propagation and mean-field theory to this problem, and show that this leads to fast, accurate algorithms for community detection.
Create a lesson
Related papers
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo
Lattice spin systems coupled to a compact U(1) gauge field with negative gauge coupling favoring frustration
Claudio Bonati, Ettore Vicari
The Inverse Mean First-Passage Time Problem
Tommer D. Keidar, Shlomi Reuveni, Igor M. Sokolov
Restricted triangular ice beyond the solvable manifolds: chiral ice and the critical region of dominant chiral vertices
Josep Batle
Establishing Néel order in the square-lattice antiferromagnetic Heisenberg model: a bootstrap proof
Nisarg Chadha, Taige Wang, Pavel A. Nosov et al.