Corpus ID: 221948971

Message passing for probabilistic models on networks with loops

@article{Kirkley2020MessagePF,
  title={Message passing for probabilistic models on networks with loops},
  author={Alec Kirkley and George T. Cantwell and M. Newman},
  journal={ArXiv},
  year={2020},
  volume={abs/2009.12246}
}
  • Alec Kirkley, George T. Cantwell, M. Newman
  • Published 2020
  • Computer Science, Physics
  • ArXiv
  • In this paper, we extend a recently proposed framework for message passing on "loopy" networks to the solution of probabilistic models. We derive a self-consistent set of message passing equations that allow for fast computation of probability distributions in systems that contain short loops, potentially with high density, as well as expressions for the entropy and partition function of such systems, which are notoriously difficult quantities to compute. Using the Ising model as an example, we… CONTINUE READING

    Figures from this paper.

    References

    SHOWING 1-10 OF 60 REFERENCES
    Message passing on networks with loops
    • 7
    • PDF
    Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
    • 552
    • PDF
    Percolation on sparse networks
    • 147
    • PDF
    Generalized Belief Propagation
    • 1,083
    • PDF
    Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs
    • 16
    • PDF
    Understanding belief propagation and its generalizations
    • 1,481
    • Highly Influential
    • PDF
    On the Choice of Regions for Generalized Belief Propagation
    • 65
    • PDF
    Spectral redemption in clustering sparse networks
    • 448
    • PDF
    Random graphs with clustering.
    • M. Newman
    • Computer Science, Physics
    • Physical review letters
    • 2009
    • 327
    • PDF