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

DOI10.1016/J.TCS.2011.02.027MaRDI QIDQ549709zbMATHOpenAlexFDO

Authors H. B. III Hunt, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, R. E. Stearns, 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

algorithmssocial networkscomplexitydynamic 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)

Recommendations

• Dynamic social network models incorporating stochasticity and delays
• scientific article; zbMATH DE number 1471878
• Spreading dynamics on complex networks: a general stochastic approach
• A general stochastic model for studying time evolution of transition networks
• A stochastic complex network model

Cites work

• scientific article; zbMATH DE number 4058875 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2046041 (Why is no real title available?)
• scientific article; zbMATH DE number 1361465 (Why is no real title available?)
• scientific article; zbMATH DE number 1848281 (Why is no real title available?)
• Algorithms for computing preimages of cellular automata configurations
• Automata, Languages and Programming
• Complexity of reachability problems for finite discrete dynamical systems
• Computation of explicit preimages in one-dimensional cellular automata applying the De Bruijn diagram
• Dichotomy results for fixed point counting in Boolean dynamical systems
• Dichotomy results for fixed-point existence problems for Boolean dynamical systems
• Discrete, sequential dynamical systems
• Elements of a theory of computer simulation. I
• Elements of a theory of simulation. II: Sequential dynamical systems.
• Elements of a theory of simulation. III: Equivalence of SDS.
• Limit Set Reachability in Asynchronous Graph Dynamical Systems
• Modeling and simulation of large biological information and socio-technical systems: an interaction-based approach
• Networks, crowds and markets. Reasoning about a highly connected world.
• On enumeration of conjugacy classes of Coxeter elements
• On the complexity of verifying concurrent transition systems
• On the computational complexity of finite cellular automata
• Predecessor existence problems for finite discrete dynamical systems
• Reachability problems for sequential dynamical systems with threshold functions.
• The Complexity of Planar Counting Problems
• Theory of cellular automata: a survey
• Unconventional Computation

Cited in

(11)

• Stochastic sharing calculus for reasoning about social networks
• Bayesian learning of stochastic dynamical models
• Complexity of inferring local transition functions of discrete dynamical systems
• A framework for simulating multiple contagions over multiple networks
• Dynamic social network models incorporating stochasticity and delays
• UNCERTAINTY VISUALIZATION FOR CHARACTERIZING HETEROGENEOUS HUMAN BEHAVIORS IN DISCRETE DYNAMICAL SYSTEM MODELS
• scientific article; zbMATH DE number 7445170 (Why is no real title available?)
• Discussion of “Inferring social structure from continuous‐time interaction data”
• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• Parties and networks: Stochastic models for relationship networks
• Attractor stability in nonuniform Boolean networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549709)