Mean field dynamics of stochastic cellular automata for random and small-world graphs
From MaRDI portal
Publication:2197113
Abstract: It was recently shown how graphs can be used to provide descriptions of psychopathologies, where symptoms of, say, depression, affect each other and certain configurations determine whether someone could fall into a sudden depression. To analyse changes over time and characterise possible future behaviour is rather difficult for large graphs. We describe the dynamics of networks using one-dimensional discrete time dynamical systems theory obtained from a mean field approach to (elementary) probabilistic cellular automata (PCA). Often the mean field approach is used on a regular graph (a grid or torus) where each node has the same number of edges and the same probability of becoming active. We show that we can use variations of the mean field of the grid to describe the dynamics of the PCA on a random and small-world graph. Bifurcation diagrams for the mean field of the grid, random, and small-world graphs indicate possible phase transitions for certain parameter settings. Extensive simulations indicate for different graph sizes (number of nodes) that the mean field approximation is accurate. The mean field approach allows us to provide possible explanations of 'jumping' behaviour in depression.
Recommendations
- Variational approximations for stochastic dynamics on graphs
- Unravelling Topological Determinants of Excitable Dynamics on Graphs Using Analytical Mean-field Approaches
- Collective dynamics in heterogeneous networks of neuronal cellular automata
- Causal graph dynamics
- DYNAMICAL ASPECTS OF INTERACTION NETWORKS
Cites work
- scientific article; zbMATH DE number 2187251 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 2229941 (Why is no real title available?)
- A First Course in Discrete Dynamical Systems
- A hierarchical state space approach to affective dynamics
- Analysis of Boolean Functions
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Collective dynamics of `small-world' networks
- Computation theory of cellular automata
- Dynamical Processes on Complex Networks
- Evolution and dynamics of small-world cellular automata
- Graphical models, exponential families, and variational inference
- Large deviations for mean field models of probabilistic cellular automata
- Markov Chains
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Markov random fields and their applications
- Matrix norms applied to weakly ergodic Markov chains
- Merging for time inhomogeneous finite Markov chains. I: Singular values and stability
- Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics
- Paths in graphs
- Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
- Random graph dynamics
- The theory of probability. Explorations and applications
- Time inhomogeneous Markov chains with wave-like behavior
Cited in
(2)
This page was built for publication: Mean field dynamics of stochastic cellular automata for random and small-world graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197113)
