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

DOI10.1016/J.TCS.2011.02.027zbMATH Open1216.91025OpenAlexW2147873479MaRDI QIDQ549709FDOQ549709

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

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

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)

Cites Work

• Networks, crowds and markets. Reasoning about a highly connected world.
• Title not available (Why is that?)
• Theory of cellular automata: a survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• Elements of a theory of computer simulation. I
• Elements of a theory of simulation. II: Sequential dynamical systems.
• Discrete, sequential dynamical systems
• On the complexity of verifying concurrent transition systems
• Elements of a theory of simulation. III: Equivalence of SDS.
• On enumeration of conjugacy classes of Coxeter elements
• The Complexity of Planar Counting Problems
• Dichotomy results for fixed point counting in Boolean dynamical systems
• Dichotomy results for fixed-point existence problems for Boolean dynamical systems
• On the computational complexity of finite cellular automata
• Predecessor existence problems for finite discrete dynamical systems
• Title not available (Why is that?)
• Complexity of reachability problems for finite discrete dynamical systems
• Reachability problems for sequential dynamical systems with threshold functions.
• Algorithms for computing preimages of cellular automata configurations
• Computation of explicit preimages in one-dimensional cellular automata applying the De Bruijn diagram
• Limit Set Reachability in Asynchronous Graph Dynamical Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unconventional Computation

Cited In (11)

• Title not available (Why is that?)
• A Framework for Simulating Multiple Contagions Over Multiple Networks
• Discussion of “Inferring social structure from continuous‐time interaction data”
• Stochastic sharing calculus for reasoning about social networks
• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• Parties and networks: Stochastic models for relationship networks
• Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
• Dynamic social network models incorporating stochasticity and delays
• Attractor stability in nonuniform Boolean networks
• UNCERTAINTY VISUALIZATION FOR CHARACTERIZING HETEROGENEOUS HUMAN BEHAVIORS IN DISCRETE DYNAMICAL SYSTEM MODELS
• Bayesian learning of stochastic dynamical models

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)