The matrix product approximation for the dynamic cavity method
From MaRDI portal
Abstract: Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages -- conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced in Phys. Rev. E 97, 010104(R) (2018), and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber-Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. We discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.
Recommendations
- Three lemmas on dynamic cavity method
- The cavity master equation: average and fixed point of the ferromagnetic model in random graphs
- Inference of kinetic Ising model on sparse graphs
- Cavity method: message-passing from a physics perspective
- Out-of-equilibrium dynamical mean-field equations for the perceptron model
Cites work
- A simple analytical description of the non-stationary dynamics in Ising spin systems
- Dynamical Processes on Complex Networks
- Dynamical replica analysis of processes on finitely connected random graphs: I. Vertex covering
- Entanglement entropy and quantum field theory
- Finitely correlated states on quantum spin chains
- Generalized mean field approximation for parallel dynamics of the Ising model
- scientific article; zbMATH DE number 42093 (Why is no real title available?)
- scientific article; zbMATH DE number 6324332 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Inference of kinetic Ising model on sparse graphs
- Information, Physics, and Computation
- Majority dynamics on trees and the dynamic cavity method
- Networks. An introduction.
- On the Early History of the Singular Value Decomposition
- Parallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions
- Parallel dynamics of disordered Ising spin systems on finitely connected random graphs
- Stochastic processes in physics and chemistry.
- Tensor-train decomposition
- The density-matrix renormalization group
- The density-matrix renormalization group in the age of matrix product states
- The patient-zero problem with noisy observations
- Time-Dependent Statistics of the Ising Model
- Variational approximations for stochastic dynamics on graphs
- Variational perturbation and extended Plefka approaches to dynamics on random networks: the case of the kinetic Ising model
Cited in
(7)- Three lemmas on dynamic cavity method
- APPLICATION OF THE R-MATRIX METHOD TO CDCC CALCULATIONS
- The cavity master equation: average and fixed point of the ferromagnetic model in random graphs
- A closure for the master equation starting from the dynamic cavity method
- Nonequilibrium steady-state dynamics of Markov processes on graphs
- Gaussian approximation of dynamic cavity equations for linearly-coupled stochastic dynamics
- Cavity method in the spherical SK model
This page was built for publication: The matrix product approximation for the dynamic cavity method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856231)