Belief propagation in monoidal categories

Jason Morton
(Pennsylvania State University)

We discuss a categorical version of the celebrated belief propagation algorithm. This provides a way to prove that some algorithms which are known or suspected to be analogous, are actually identical when formulated generically. It also highlights the computational point of view in monoidal categories.

In Bob Coecke, Ichiro Hasuo and Prakash Panangaden: Proceedings of the 11th workshop on Quantum Physics and Logic (QPL 2014), Kyoto, Japan, 4-6th June 2014, Electronic Proceedings in Theoretical Computer Science 172, pp. 262–269.
Published: 28th December 2014.

ArXived at: http://dx.doi.org/10.4204/EPTCS.172.18 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org