DIS-NNLGJan 5, 2021

Exact solution to the random sequential dynamics of a message passing algorithm

arXiv:2101.01571v23 citations
AI Analysis

This work provides an exact solution for the dynamics of a message passing algorithm, which is significant for researchers working on statistical physics and message passing algorithms, offering a deeper theoretical understanding of their convergence properties.

This paper analyzes the random sequential dynamics of a message passing algorithm for Ising models with random interactions in the large system limit. It derives exact results for two-time correlation functions and speed of convergence, finding that the de Almedia-Thouless stability criterion is necessary and sufficient for global convergence.

We analyze the random sequential dynamics of a message passing algorithm for Ising models with random interactions in the large system limit. We derive exact results for the two-time correlation functions and the speed of convergence. The {\em de Almedia-Thouless} stability criterion of the static problem is found to be necessary and sufficient for the global convergence of the random sequential dynamics.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes