Search for: All records

Using a discrete dynamical system model for a networked social system, we consider the problem of learning a class of local interaction functions in such networks. Our focus is on learning local functions which are based on pairwise disjoint coalitions formed from the neighborhood of each node. Our work considers both active query and PAC learning models. We establish bounds on the number of queries needed to learn the local functions under both models.We also establish a complexity result regarding efficient consistent learners for such functions. Our experimental results on synthetic and real social networks demonstrate how the number of queries depends on the structure of the underlying network and number of coalitions. 

Recent results from social science have indicated that neighborhood effects have an important role in an evacuation decision by a family. Neighbors evacuating can motivate a family to evacuate. On the other hand, if a lot of neighbors evacuate, then the likelihood of an individual or family deciding to evacuate decreases, for fear of looting. Such behavior cannot be captured using standard models of contagion spread on networks, e.g., threshold models. Here, we propose a new graph dynamical system model, 2mode-threshold, which captures such behaviors. We study the dynamical properties of 2mode-threshold in different networks, and find significant differences from a standard threshold model. We demonstrate the utility of our model through agent based simulations on small world networks of Virginia Beach, VA. We use it to understand evacuation rates in this region, and to evaluate the effects of the model and of different initial conditions on evacuation decision dynamics. 

Anagram games (i.e., word construction games in which players use letters to form words) have been researched for some 60 years. Games with individual players are the subject of over 20 published investigations. Moreover, there are many popular commercial anagram games such as Scrabble. Recently, cooperative team play of anagram games has been studied experimentally. With all of the experimental work and the popularity of such games, it is somewhat surprising that very little modeling of anagram games has been done to predict player behavior/actions in them. We devise a cooperative group anagram game and develop an agent-based modeling and simulation framework to capture player interactions of sharing letters and forming words. Our primary goals are to understand, quantitatively predict, and explain individual and aggregate group behavior, through simulations, to inform the design of a group anagram game experimental platform.