Backtracking Dynamical Cavity Method

Abstract

The cavity method is one of the cornerstones of the statistical physics of disordered systems such as spin glasses and other complex systems. It is able to analytically and asymptotically exactly describe the equilibrium properties of a broad range of models. Exact solutions for dynamical, out-of-equilibrium properties of disordered systems are traditionally much harder to obtain. Even very basic questions such as the limiting energy of a fast quench are so far open. The dynamical cavity method partly fills this gap by considering short trajectories and leveraging the static cavity method. However, being limited to a couple of steps forward from the initialization it typically does not capture dynamical properties related to attractors of the dynamics. We introduce the backtracking dynamical cavity method that instead of analysing the trajectory forward from initialization, analyses trajectories that are found by tracking them backward from attractors. We illustrate that this rather elementary twist on the dynamical cavity method leads to new insight into some of the very basic questions about the dynamics of complex disordered systems. This method is as versatile as the cavity method itself and we hence anticipate that our paper will open many avenues for future research of dynamical, out-of-equilibrium, properties in complex systems.

arXiv comment14 pages

References in corpus (13)

• The Bethe lattice spin glass revisited
• Phase Transitions in the Coloring of Random Graphs
• Optimizing spread dynamics on graphs by message passing
• Dynamic message-passing equations for models with unidirectional dynamics
• Parallel dynamics of disordered Ising spin systems on finitely connected random graphs
• Majority dynamics on trees and the dynamic cavity method
• The Cavity Approach to Parallel Dynamics of Ising Spins on a Graph
• Dynamic mean-field and cavity methods for diluted Ising systems
• Conjecture on the maximum cut and bisection width in random regular graphs
• Parallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions
• Inference of kinetic Ising model on sparse graphs
• A matrix product algorithm for stochastic dynamics on networks, applied to non-equilibrium Glauber dynamics
• On the number of limit cycles in diluted neural networks

Cited by in corpus (6)

• Dynamical Mean-Field Theory of Complex Systems on Sparse Directed Networks
• Dynamical Phase Transitions in Graph Cellular Automata
• Quenches in the Sherrington-Kirkpatrick model
• Counting and Hardness-of-Finding Fixed Points in Cellular Automata on Random Graphs
• Minority Takeover in Majority Dynamics: Searching for Rare Initializations via the History Passing Algorithm
• Dynamical Cavity Method for Hypergraphs and its Application to Quenches in the k-XOR-SAT Problem