Mean field dynamics of stochastic cellular automata for random and small-world graphs

DOI10.1016/J.JMP.2020.102380zbMATH Open1448.91232arXiv1610.05105OpenAlexW3027848194MaRDI QIDQ2197113FDOQ2197113

Authors: Jolanda Kossakowski, Lourens J. Waldorp 

Publication date: 4 September 2020

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1610.05105

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

zbMATH Keywords

bifurcationcellular automatadiscrete dynamical systemnonlinear dynamicspsychopathology

Mathematics Subject Classification ID

Cognitive psychology (91E10) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Cellular automata (computational aspects) (68Q80)

Cites Work

• Graphical models, exponential families, and variational inference
• Markov Chains
• Collective dynamics of `small-world' networks
• Title not available (Why is that?)
• Random graph dynamics
• Paths in graphs
• Analysis of Boolean Functions
• Dynamical Processes on Complex Networks
• Title not available (Why is that?)
• Markov random fields and their applications
• Large deviations for mean field models of probabilistic cellular automata
• Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
• The theory of probability. Explorations and applications
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Title not available (Why is that?)
• Computation theory of cellular automata
• Merging for time inhomogeneous finite Markov chains. I: Singular values and stability
• Time inhomogeneous Markov chains with wave-like behavior
• Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• A First Course in Discrete Dynamical Systems
• A hierarchical state space approach to affective dynamics
• Evolution and dynamics of small-world cellular automata
• Matrix norms applied to weakly ergodic Markov chains

Cited In (2)

• Ising formulations of some graph-theoretic problems in psychological research: models and methods
• A comprehensive taxonomy of cellular automata

Uses Software

• mgm
• GitHub

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)