An Operator Interpretation of Message Passing

Message passing algorithms may be viewed from a purely probabilistic or statistical physics perspective. This works describes an alternative, linear algebraic view of message passing in trees. We demonstrate the construction of global belief operators on Markov Chains and Trees and compare these with classical results. By interpreting message passing as finding a global stable solution we wish to avoid application dependent development of message passing methods of more complex graph structures.