Dynamic message-passing approach for kinetic spin models with reversible dynamics

Abstract

A method to approximately close the dynamic cavity equations for synchronous reversible dynamics on a locally tree-like topology is presented. The method builds on $(a)$ a graph expansion to eliminate loops from the normalizations of each step in the dynamics, and $(b)$ an assumption that a set of auxilary probability distributions on histories of pairs of spins mainly have dependencies that are local in time. The closure is then effectuated by projecting these probability distributions on $n$-step Markov processes. The method is shown in detail on the level of ordinary Markov processes ($n=1$), and outlined for higher-order approximations ($n>1$). Numerical validations of the technique are provided for the reconstruction of the transient and equilibrium dynamics of the kinetic Ising model on a random graph with arbitrary connectivity symmetry.

6 pages, 4 figures

References in corpus (11)

• Epidemic spreading in scale-free networks
• Inferring the origin of an epidemic with a dynamic message-passing algorithm
• Exact solutions for diluted spin glasses and optimization problems
• Dynamic message-passing equations for models with unidirectional dynamics
• Parallel dynamics of disordered Ising spin systems on finitely connected random graphs
• Amorphous-amorphous transition and the two-step replica symmetry breaking phase
• Large deviations of cascade processes on graphs
• Dynamical TAP equations for non-equilibrium Ising spin glasses
• Dynamic mean-field and cavity methods for diluted Ising systems
• A message-passing scheme for non-equilibrium stationary states
• Variational approximations for stationary states of Ising-like models