Generalizations of Threshold Graph Dynamical Systems

Dynamics of social processes in populations, such as the spread of emotions, influence, language, mass movements, and warfare (often referred to individually and collectively as contagions), are increasingly studied because of their social, political, and economic impacts. Discrete dynamical systems...

Full description

Bibliographic Details
Main Author: Kuhlman, Christopher James
Other Authors: Mathematics
Format: Others
Language:en_US
Published: Virginia Tech 2017
Subjects:
Online Access:http://hdl.handle.net/10919/76765
http://scholar.lib.vt.edu/theses/available/etd-05152013-170830/
id ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-76765
record_format oai_dc
spelling ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-767652020-09-29T05:47:02Z Generalizations of Threshold Graph Dynamical Systems Kuhlman, Christopher James Mathematics Mortveit, Henning S. Borggaard, Jeffrey T. Floyd, William J. network dynamics contagion processes graph dynamical systems social behavior Dynamics of social processes in populations, such as the spread of emotions, influence, language, mass movements, and warfare (often referred to individually and collectively as contagions), are increasingly studied because of their social, political, and economic impacts. Discrete dynamical systems (discrete in time and discrete in agent states) are often used to quantify contagion propagation in populations that are cast as graphs, where vertices represent agents and edges represent agent interactions. We refer to such formulations as graph dynamical systems. For social applications, threshold models are used extensively for agent state transition rules (i.e., for vertex functions). In its simplest form, each agent can be in one of two states (state 0 (1) means that an agent does not (does) possess a contagion), and an agent contracts a contagion if at least a threshold number of its distance-1 neighbors already possess it. The transition to state 0 is not permitted. In this study, we extend threshold models in three ways. First, we allow transitions to states 0 and 1, and we study the long-term dynamics of these bithreshold systems, wherein there are two distinct thresholds for each vertex; one governing each of the transitions to states 0 and 1. Second, we extend the model from a binary vertex state set to an arbitrary number r of states, and allow transitions between every pair of states. Third, we analyze a recent hierarchical model from the literature where inputs to vertex functions take into account subgraphs induced on the distance-1 neighbors of a vertex. We state, prove, and analyze conditions characterizing long-term dynamics of all of these models. Master of Science 2017-04-04T19:49:05Z 2017-04-04T19:49:05Z 2013-05-02 2013-05-15 2016-10-04 2013-06-07 Thesis Text etd-05152013-170830 http://hdl.handle.net/10919/76765 http://scholar.lib.vt.edu/theses/available/etd-05152013-170830/ en_US In Copyright http://rightsstatements.org/vocab/InC/1.0/ application/pdf Virginia Tech
collection NDLTD
language en_US
format Others
sources NDLTD
topic network dynamics
contagion processes
graph dynamical systems
social behavior
spellingShingle network dynamics
contagion processes
graph dynamical systems
social behavior
Kuhlman, Christopher James
Generalizations of Threshold Graph Dynamical Systems
description Dynamics of social processes in populations, such as the spread of emotions, influence, language, mass movements, and warfare (often referred to individually and collectively as contagions), are increasingly studied because of their social, political, and economic impacts. Discrete dynamical systems (discrete in time and discrete in agent states) are often used to quantify contagion propagation in populations that are cast as graphs, where vertices represent agents and edges represent agent interactions. We refer to such formulations as graph dynamical systems. For social applications, threshold models are used extensively for agent state transition rules (i.e., for vertex functions). In its simplest form, each agent can be in one of two states (state 0 (1) means that an agent does not (does) possess a contagion), and an agent contracts a contagion if at least a threshold number of its distance-1 neighbors already possess it. The transition to state 0 is not permitted. In this study, we extend threshold models in three ways. First, we allow transitions to states 0 and 1, and we study the long-term dynamics of these bithreshold systems, wherein there are two distinct thresholds for each vertex; one governing each of the transitions to states 0 and 1. Second, we extend the model from a binary vertex state set to an arbitrary number r of states, and allow transitions between every pair of states. Third, we analyze a recent hierarchical model from the literature where inputs to vertex functions take into account subgraphs induced on the distance-1 neighbors of a vertex. We state, prove, and analyze conditions characterizing long-term dynamics of all of these models. === Master of Science
author2 Mathematics
author_facet Mathematics
Kuhlman, Christopher James
author Kuhlman, Christopher James
author_sort Kuhlman, Christopher James
title Generalizations of Threshold Graph Dynamical Systems
title_short Generalizations of Threshold Graph Dynamical Systems
title_full Generalizations of Threshold Graph Dynamical Systems
title_fullStr Generalizations of Threshold Graph Dynamical Systems
title_full_unstemmed Generalizations of Threshold Graph Dynamical Systems
title_sort generalizations of threshold graph dynamical systems
publisher Virginia Tech
publishDate 2017
url http://hdl.handle.net/10919/76765
http://scholar.lib.vt.edu/theses/available/etd-05152013-170830/
work_keys_str_mv AT kuhlmanchristopherjames generalizationsofthresholdgraphdynamicalsystems
_version_ 1719346686446272512