Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems

DOI10.1016/j.tcs.2011.02.027zbMath1216.91025OpenAlexW2147873479MaRDI QIDQ549709

Richard E. Stearns, S. S. Ravi, Harry B. III Hunt, Daniel J. Rosenkrantz, Madhav V. Marathe, Chris L. Barrett

Publication date: 18 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.027

zbMATH Keywords

complexityalgorithmssocial networksdynamic behaviorfinite one-dimensional CApredecessor (preimage)stochastic graphical dynamical systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Applications of dynamical systems (37N99)

Related Items (6)

A Framework for Simulating Multiple Contagions Over Multiple Networks ⋮ Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems ⋮ UNCERTAINTY VISUALIZATION FOR CHARACTERIZING HETEROGENEOUS HUMAN BEHAVIORS IN DISCRETE DYNAMICAL SYSTEM MODELS ⋮ Attractor stability in nonuniform Boolean networks ⋮ Bayesian learning of stochastic dynamical models ⋮ Inferring local transition functions of discrete dynamical systems from observations of system behavior

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of reachability problems for finite discrete dynamical systems
• Dichotomy results for fixed-point existence problems for Boolean dynamical systems
• Elements of a theory of computer simulation. I
• Reachability problems for sequential dynamical systems with threshold functions.
• Elements of a theory of simulation. II: Sequential dynamical systems.
• Theory of cellular automata: a survey
• Discrete, sequential dynamical systems
• On the complexity of verifying concurrent transition systems
• Elements of a theory of simulation. III: Equivalence of SDS.
• On the computational complexity of finite cellular automata
• Dichotomy results for fixed point counting in Boolean dynamical systems
• Algorithms for computing preimages of cellular automata configurations
• Predecessor existence problems for finite discrete dynamical systems
• On enumeration of conjugacy classes of Coxeter elements
• Limit Set Reachability in Asynchronous Graph Dynamical Systems
• The Complexity of Planar Counting Problems
• Unconventional Computation
• Automata, Languages and Programming

This page was built for publication: Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems