The Bethe permanent of a non-negative matrix

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 341-346

  Vontobel, Pascal O ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BETHE FREE ENERGY; CODE-WORDS; CONVEX FUNCTIONS; EMPIRICAL EVIDENCE; MATRIX; MATRIX SIZE; NON-NEGATIVE MATRIX; SUM PRODUCT; SUM-PRODUCT ALGORITHM;

FREE ENERGY; OPTIMIZATION;

MATRIX ALGEBRA;

EID: 79952391347     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5706926     Document Type: Conference Paper

References (19)

1. H. Minc, Permanents. Reading, MA: Addison-Wesley, 1978.
2. H. J. Ryser, Combinatorial Mmathematics (Carus Mathematical Monographs No. 14). Mathematical Association of America, 1963.
3. L. Valiant, "The complexity of computing the permanent," Theor. Comp. Sc., vol. 8, no. 2, pp. 189-201, 1979.
4. P. Dagum and M. Luby, "Approximating the permanent of graphs with large factors," Theoretical Computer Science, vol. 102, no. 2, pp. 283-305, 1992.
5. M. Jerrum, A. Sinclair, and E. Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries," J. ACM, vol. 51, no. 4, pp. 671-697, July 2004.
6. M. Chertkov, L. Kroc, and M. Vergassola, "Belief propagation and beyond for particle tracking," CoRR, available online under http://arxiv.org/abs/0806.1199, June 2008.
7. B. Huang and T. Jebara, "Approximating the permanent with belief propagation," CoRR, available online under http://arxiv.org/abs/0908.1769, Aug. 2009.
8. J. S. Yedidia, W. T. Freeman, and Y. Weiss, "Constructing free-energy approximations and generalized belief propagation algorithms," IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2282-2312, July 2005.
9. Y. Watanabe and M. Chertkov, "Belief propagation and loop calculus for the permanent of a non-negative matrix," Journal of Physics A: Mathematical and Theoretical, vol. 43, p. 242002, 2010.
10. M. Chertkov, L. Kroc, F. Krzakala, M. Vergassola, and L. Zdeborová, "Inference in particle tracking experiments by passing messsages between images," Proc. Natl. Acad. Sci., vol. 107, pp. 7663-8, 2010.
11. M. Bayati and C. Nair, "A rigorous proof of the cavity method for counting matchings," in Proc. 44th Allerton Conf. on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sep. 27-29 2006.
12. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, UK: Cambridge University Press, 2004.
13. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge: Cambridge University Press, 1990, corrected reprint of the 1985 original.
14. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
15. G. D. Forney, Jr., "Codes on graphs: normal realizations," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.
16. H.-A. Loeliger, "An introduction to factor graphs," IEEE Sig. Proc. Mag., vol. 21, no. 1, pp. 28-41, Jan. 2004.
17. D. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA: Athena Scientific, 1999.
18. R. Smarandache and P. O. Vontobel, "Absdet-pseudo-codewords and perm-pseudo-codewords: definitions and properties," in Proc. IEEE Int. Symp. Information Theory, Seoul, Korea, June 28-July 3 2009.
19. M. Cuturi, "Permanents, transportation polytopes and positive definite kernels on histograms," in Proc. Int. Joint Conf. Artificial Intelligence, Hyderabad, India, Jan. 6-12 2007.