On factor graphs and electrical networks
From MaRDI portal
The authors use factor graphs with origins in coding theory in order to express a one-to-one correspondence between a class of static electrical circuits and multivariable probability distributions. The factor graphs appear as variational representations of electrical networks. It is shown that the sum-product and max-product algorithm coincide, for the classical linear state space models, with Kalman filtering. Circuit theory interpretations are disscussed as well. For the entire collection see [Zbl 1024.00040].
Recommendations
- Factor graphs and the sum-product algorithm
- On factorization of probability distributions over directed graphs.
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- Graphical models, exponential families, and variational inference
- Correctness of belief propagation in Gaussian graphical models of arbitrary topology
Cited in
(8)- Factor metanetwork: a multilevel probabilistic meta-model based on factor graphs
- Using graph theory for automated electric circuit solving
- On Factor Graphs and the Fourier Transform
- scientific article; zbMATH DE number 3598498 (Why is no real title available?)
- Factor graphs and the sum-product algorithm
- On factorization of probability distributions over directed graphs.
- The sum-product algorithm on small graphs
- Bond graphs. III: Bond graphs and electrical networks
This page was built for publication: On factor graphs and electrical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4462139)
