Duality of graphical models and tensor networks

45Citations
Citations of this article
85Readers
Mendeley users who have this article in their library.

Abstract

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a hypergraph exactly corresponds to the graphical model given by the dual hypergraph.We translate various notions under duality. For example, marginalization in a graphical model is dual to contraction in the tensor network. Algorithms also translate under duality. We show that belief propagation corresponds to a known algorithm for tensor network contraction. This article is a reminder that the research areas of graphical models and tensor networks can benefit from interaction.

Cite

CITATION STYLE

APA

Robeva, E., & Seigal, A. (2019). Duality of graphical models and tensor networks. Information and Inference, 8(2), 273–288. https://doi.org/10.1093/imaiai/iay009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free