Survey Propagation as "Probabilistic Token Passing"
Ronghui Tu, Yongyi Mao, Jun Zhao · IEICE Transactions on Information and Systems · 2008
In this paper, we present a clean and simple formulation of survey propagation (SP) for constraint-satisfaction problems as “probabilistic token passing”. The result shows the importance of extending variable alphabets to their power sets in designing SP algorithms.