Parallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions
arXiv:0907.1699 · doi:10.1088/1751-8113/42/41/415001
Abstract
We study the stochastic parallel dynamics of Ising spin systems defined on finitely connected directed random graphs with arbitrary degree distributions, using generating functional analysis. For fully asymmetric graphs the dynamics of the system can be completely solved, due to the asymptotic absence of loops. For arbitrary graph symmetry, we solve the dynamics exactly for the first few time steps, and we construct approximate stationary solutions.
20 pages, 4 figures
References in corpus (28)
- Statistical mechanics of the random K-SAT model
- Optimisation problems and replica symmetry breaking in finite connectivity spin-glasses
- The Statistical Physics of Regular Low-Density Parity-Check Error-Correcting Codes
- Thouless-Anderson-Palmer Approach for Lossy Compression
- Tricritical Points in Random Combinatorics: the (2+p)-SAT case
- Parallel dynamics of disordered Ising spin systems on finitely connected random graphs
- Replicated Transfer Matrix Analysis of Ising Spin Models on `Small World' Lattices
- Locked constraint satisfaction problems
- Finite-connectivity systems as error-correcting codes
- Statistical Mechanics of Low-Density Parity Check Error-Correcting Codes over Galois Fields
- Finitely connected vector spin systems with random matrix interactions
- Sparsely-spread CDMA - a statistical mechanics based analysis
- On the stochastic dynamics of disordered spin models
- Analytic solution of attractor neural networks on scale-free graphs
- Approximation schemes for the dynamics of diluted spin models: the Ising ferromagnet on a Bethe lattice
- Gallager error correcting codes for binary asymmetric channels
- The Little-Hopfield model on a Random Graph
- Cavity approach for real variables on diluted graphs and application to synchronization in small-world lattices
- Dynamical replica analysis of disordered Ising spin systems on finitely connected random graphs
- One step RSB scheme for the rate distortion function
- Dynamics of dilute disordered models: a solvable case
- Spin models on random graphs with controlled topologies beyond degree constraints
- Dynamical replica analysis of processes on finitely connected random graphs II: Dynamics in the Griffiths phase of the diluted Ising ferromagnet
- Dynamical replica analysis of processes on finitely connected random graphs I: vertex covering
- Statistical Mechanics Analysis of LDPC Coding in MIMO Gaussian Channels
- Dynamic rewiring in small world networks
- Statics and dynamics of the Lebwohl-Lasher model in the Bethe approximation
- Typical Performance of Irregular Low-Density Generator-Matrix Codes for Lossy Compression
Cited by in corpus (22)
- Dynamic message-passing equations for models with unidirectional dynamics
- A message-passing scheme for non-equilibrium stationary states
- Noisy Random Boolean Formulae - a Statistical Physics Perspective
- Dynamical Mean-Field Theory of Complex Systems on Sparse Directed Networks
- Causal analysis, Correlation-Response and Dynamic cavity
- Dynamics of Boolean networks - an exact solution
- Dynamical Phase Transitions in Graph Cellular Automata
- Backtracking Dynamical Cavity Method
- Quenches in the Sherrington-Kirkpatrick model
- Generating functional analysis of complex formation and dissociation in large protein interaction networks
- The matrix product approximation for the dynamic cavity method
- Dynamics of sparse Boolean networks with multi-node and self-interactions
- Nonequilibrium dynamics of the Ising model on heterogeneous networks with an arbitrary distribution of threshold noise
- Multi-step relaxations in Glauber dynamics of a bond-diluted Ising model on a Bethe lattice
- Phase transitions and memory effects in the dynamics of Boolean networks
- Heat-Bath and Metropolis Dynamics in Ising-like Models on Directed Regular Random Graphs
- Mean-field approximation and phase transitions in an Ising-voter model on directed regular random graphs
- Starvation suppression in dense scale-free metabolic networks: Dynamical mean-field analysis of catalytic reaction networks
- Overcoming the complexity barrier of the dynamic message-passing method in networks with fat-tailed degree distributions
- Mean-field theory of vector spin models on networks with arbitrary degree distributions
- Uncovering the non-equilibrium stationary properties in sparse Boolean networks
- Dynamical Cavity Method for Hypergraphs and its Application to Quenches in the k-XOR-SAT Problem