 Research
 Open Access
 Published:
Early warning analysis for social diffusion events
Security Informatics volume 1, Article number: 18 (2012)
Abstract
There is considerable interest in developing predictive capabilities for social diffusion processes, for instance to permit early identification of emerging contentious situations, rapid detection of disease outbreaks, or accurate forecasting of the ultimate reach of potentially “viral” ideas or behaviors. This paper proposes a new approach to this predictive analytics problem, in which analysis of mesoscale network dynamics is leveraged to generate useful predictions for complex social phenomena. We begin by deriving a stochastic hybrid dynamical systems (SHDS) model for diffusion processes taking place over social networks with realistic topologies; this modeling approach is inspired by recent work in biology demonstrating that SHDS offer a useful mathematical formalism with which to represent complex, multiscale biological network dynamics. We then perform formal stochastic reachability analysis with this SHDS model and conclude that the outcomes of social diffusion processes may depend crucially upon the way the early dynamics of the process interacts with the underlying network’s community structure and coreperiphery structure. This theoretical finding provides the foundations for developing a machine learning algorithm that enables accurate early warning analysis for social diffusion events. The utility of the warning algorithm, and the power of networkbased predictive metrics, are demonstrated through an empirical investigation of the propagation of political “memes” over social media networks. Additionally, we illustrate the potential of the approach for security informatics applications through case studies involving early warning analysis of largescale protests events and politicallymotivated cyber attacks.
Introduction
Understanding the way information, behaviors, innovations, and diseases propagate over social networks is of great importance in a wide variety of domains e.g., [1–4], including national security e.g., [5–13]. Of particular interest are predictive capabilities for social diffusion, for instance to enable early warning concerning the emergence of a violent conflict or outbreak of an epidemic. As a consequence, vast resources are devoted to the task of predicting the outcomes of diffusion processes, but the quality of such predictions is often poor. It is tempting to conclude that the problem is one of insufficient information. Clearly diffusion phenomena which “go viral” are qualitatively different from those that don’t or they wouldn’t be so dominant, the conventional wisdom goes, so in order to make good predictions we must collect enough data to allow these crucial differences to be identified.
Recent research calls into question this intuitively plausible premise and, indeed, indicates that intuition can be an unreliable guide to constructing successful prediction methods. For example, studies of the predictability of popular culture indicate that the intrinsic attributes commonly believed to be important when assessing the likelihood of adoption of cultural products, such as the quality of the product itself, do not possess much predictive power [14–16]. This research offers evidence that, when individuals are influenced by the actions of others, it may not be possible to obtain reliable predictions using methods which focus on intrinsics alone; instead, it may be necessary to incorporate aspects of social influence into the prediction process. Very recently a handful of investigations have shown the value of considering even simple and indirect measures of social influence, such as early social media “buzz”, when forming predictions. This work has produced useful prediction algorithms for an array of social phenomena, including markets [16–21], political and social movements [17, 22], mobilization and protest behavior [23, 24], epidemics [17, 25], social media dynamics [26, 27], and the evolution of cyber threats [28].
Recognizing the importance of accounting for social influence, this paper proposes a predictive methodology which explicitly considers the way individuals influence one another through their social networks. It is expected that prediction algorithms which are based, in part, on network dynamics metrics will outperform existing methods and be applicable to a wider range of diffusion systems. We begin by developing a stochastic hybrid dynamical systems (SHDS) model for diffusion processes taking place over social networks with realistic topologies. This modeling approach is inspired by recent work in biology demonstrating that SHDS offer a useful mathematical formalism with which to represent multiscale biological network dynamics [29–33]. An SHDS is a feedback interconnection of a discretestate stochastic process, such as a Markov chain, with a family of continuousstate stochastic dynamical systems [34]. Combining discrete and continuous dynamics in this way provides a rigorous, expressive, and computationallytractable framework for modeling the dynamics of the complex, highlyevolved networks that are ubiquitous in biological systems [35], and we show in this paper that the SHDS framework is also wellsuited to the task of modeling the network dynamics which underlie social diffusion.
With the SHDS model in hand, we then perform formal stochastic reachability analysis and conclude that the outcomes of social diffusion processes may depend crucially upon the way the early dynamics of the process propagates with respect to the underlying network’s 1.) community structure, that is, densely connected groupings of individuals which have only relatively few links to other groups [36], and 2.) coreperiphery structure, reflecting the presence of a small group of “core” individuals that are densely connected to each other and are also close to the remainder of the network [36]. This theoretical finding leads to the identification of novel metrics for the community and coreperiphery dynamics which should be useful early indicators of which diffusion events will propagate widely, ultimately affecting a substantial portion of the population of interest, and which will not. Prediction is accomplished with a machine learning algorithm [37] which is based, in part, on these network dynamics metrics.
The paper makes three main contributions. First, we present a new SHDSbased framework for modeling social diffusion on networks of realworld scale and complexity, enabling these dynamics to be appropriately represented as multiscale phenomena. Second, we formulate predictive analysis problems as questions concerning the reachability of diffusion events, and present a novel “altitude function” method for assessing reachability without simulating system trajectories. The altitude function technique is both mathematically rigorous and computationally tractable, thereby permitting the derivation of provablycorrect assessments for complex, largescale systems. Third, the SHDS model and altitude function analytics are used to characterize the importance of mesoscale network features, specifically network community and coreperiphery structures, for understanding diffusion processes and predicting their fates. This characterization, in turn, forms the foundation for developing a new machine learningbased classification algorithm which employs these network dynamics features for accurate early warning analysis. Additionally, we evaluate the efficacy of this early warning algorithm through three empirical case studies investigating: 1.) the propagation of political “memes” [38] over social media networks, 2.) warning analysis for largescale mobilization and protest events, and 3.) early warning for politicallymotivated cyber attacks. These empirical studies illustrate the effectiveness of the proposed early warning methodology and demonstrate the significant predictive power of mesoscale network metrics for social diffusion processes. Moreover, the results indicate that the proposed algorithm provides a readilyimplementable Webbased tool for early warning analysis for important classes of securityrelevant diffusion events.
Early Warning Methodology
This section begins by defining the class of early warning problems of interest, then presents a brief, intuitive summary of the proposed social diffusion modeling and predictive analysis procedure, and finally describes the early warning indicators identified through this analytic procedure and the warning algorithm that is derived based on these results. A detailed mathematical presentation of the modeling and analysis methods is provided in Appendices One and Two.
2.1 Problem Formulation
The objective of this paper is to develop a scientificallyrigorous, practicallyimplementable methodology for performing early warning analysis for social diffusion events. Roughly speaking, we suppose that some “triggering event” has taken place or contentious issue is emerging, and we wish to determine, as early as possible, whether this event or issue will ultimately generate a large, selfsustaining reaction, involving the diffusion of discussions and actions through a substantial segment of a population, or will instead quickly dissipate. An illustrative example of the basic idea is provided by the contrasting reactions to 1.) the publication in September 2005 of cartoons depicting Mohammad in the Danish newspaper JyllandsPosten, and 2.) the lecture given by Pope Benedict XVI in September 2006 quoting controversial material concerning Islam. While each event appeared at the outset to have the potential to trigger significant protests, the “Danish cartoons” incident ultimately led to substantial Muslim mobilization, including massive protests and considerable violence, while outrage triggered by the pope lecture quickly subsided with essentially no violence. It would obviously be very useful to have the capability to distinguish these two types of reaction as early in the event lifecycle as possible.
In order to state the early warning problem more precisely, we make a few assumptions:

We suppose that the triggering event or emerging situation is given. Note that this is often the case in national security settings, and that additionally there exist techniques for discovering such events or issues in an automated or semiautomated manner e.g., [24, 27].

It is assumed that data are available which provide a view of the early reaction of a relevant population to the trigger or issue of interest. These data can be only indirectly related to the event; for example, in this paper the primary data source is social media discussions (e.g., blog posts) while the events of interest are “realworld” activities such as protests.

It is expected that the “customer” for the analysis provides at least qualitative definitions of the population of interest and the scale of reaction for which a warning is desired. Thus, for instance, in the example above, it might be of interest to anticipate Muslim reaction to the triggering incident, and to obtain a warning alert if the reaction is likely to eventually include selfsustaining, violent protests.
We formulate the early warning problem as a classification task. More specifically, given a triggering incident, one or more information sources which reflect (perhaps indirectly) the reaction to this trigger by a population of interest (e.g., social media discussions, intelligence reporting), and a definition for what constitutes an “alarming” reaction, the goal is to design a classifier which accurately predicts, as early as possible, whether or not reaction to the event will ultimately become alarming. Note that a more mathematically precise statement of this warning problem is given in Appendix Two. Observe that this type of warning analysis is both important in applications and “easier” to accomplish than more standard prediction or forecasting goals. Consider, as a familiar nonsecurity example, the case of movie success. It is shown in [14–16] that it is likely to be impossible to predict movie revenues, even very roughly, based on the intrinsic information available concerning the movie ex ante (e.g., personnel, genre, critic reviews). However, we have demonstrated that it is possible to identify early indicators of movie success, such as temporal patterns in prerelease “buzz”, and to use these indicators to accurately predict ultimate box office revenues [39]. Recent research indicates that this result holds more generally, so that it may be more scientificallysensible in many domains to pursue early warning rather than ex ante prediction goals [14–28].
2.2 SHDS Social Diffusion Model
In social diffusion, individuals are affected by what others do. This is easy to visualize in the case of disease transmission, with infections being passed from person to person. Information, innovations, behaviors, and so on can also propagate through a population, as individuals become aware of a new piece of information or an activity and are persuaded of its relevance and utility through their social and information networks. The dynamics of social diffusion can therefore depend upon the topological features of the pertinent networks, such as the presence of highly connected blogs in a social media network (see, e.g., [4]). Indeed, social scientists have developed extensive theories explaining the role of social networks in the dynamics of social diffusion and mobilization (see the books [2–4] and the references therein, and also Appendix One, for discussions of this work). This dependence suggests that, in order to understand the predictability of social diffusion phenomena and in particular to identify features which possess predictive power, it is necessary to conduct the analysis using social and information network models with realistic topologies.
The social diffusion models examined in this study possess networks with three topological properties that are ubiquitous in realworld social and information networks and which have the potential to impact diffusion dynamics [36]:

transitivity – the property that the network neighbors of a given individual have a heightened probability of being connected to one another;

community structure – the presence of densely connected groupings of individuals which have only relatively few links to other groups;

coreperiphery structure – the presence of a small group of “core” individuals which are densely connected to each other and are also close to the other individuals in the network.
Additionally, we permit our network models to possess rightskewed degree distributions, in which most individuals have only a few network neighbors while a few individuals have a great many neighbors, as such networks are common in online settings. The manner in which the communities and the coreperiphery are arranged will be said to define the network’s mesoscale structure. For convenience of exposition, the subsets of individuals specified by a partitioning of the network into communities and into a core and periphery will sometimes be referred to as the partition elements, and the collection of these (community and coreperiphery) subsets will be called the network partition.
In order to deal effectively with networks possessing realistic topologies, and in particular to represent and analyze the way social dynamics is affected by the mesoscale structure, we model social diffusion in a manner which explicitly separates the individual, or “micro”, dynamics from the collective dynamics. More specifically, we adopt a multiscale modeling framework consisting of three network scales:

a microscale, for modeling the behavior of individuals;

a mesoscale, which represents the interaction dynamics of individuals within the same network partition element (community or core/periphery);

a macroscale, which characterizes the interaction between partition elements.
The microscale quantifies the way individuals combine their own inherent preferences or attributes with the influences of others to arrive at their chosen courses of action. It is shown in Appendix One that separating the microscale dynamics from the meso and macroscale activity permits the dependence of this decisionmaking process on the social network to be characterized in a surprisingly straightforward way. The meso and macroscale components of the proposed modeling framework together quantify the way the decisionmaking processes of individuals interact to produce collective behavior at the population level. The role of the mesoscale model is to quantify and illuminate the manner in which behaviors within each network partition element (communities, core or periphery), while the macroscale model captures the interactions between these elements. The primary assumptions are that interactions between individuals belonging to the same network partition element can be modeled more simply than those between individuals from distinct partition elements, and that the latter interactions are constrained by the “metanetwork” which defines the dependencies between the partition elements.
This perspective offers a number of advantages. For example, at the microscale it is possible to unify behaviors which appear different phenomenologically but actually possess equivalent dynamics. We show in Appendix One that the social dynamics associated with classical “utilitymaximizing” behavior and those arising from individuals attempting to infer information by observing the actions of others can be represented with the same microscale model. Additionally, separating the individual and collective dynamics supports efficient and flexible model building and simplifies the process of estimating model components from empirical data [39]. Dividing the collective dynamics into meso and macroscales also provides a mathematicallytractable, sociologicallysensible means of representing complex social network dynamics. For instance, because network communities are topological structures corresponding to localized social settings in the real world, determined by workplace, family, physical neighborhood, and so on, it is natural both mathematically and sociologically to model the interactions of individuals within communities as qualitatively different (e.g., more frequent and homogeneous) than those between communities.
Developing a mathematicallyrigorous, expressive, scalable, and computationallytractable framework within which multiscale social network diffusion models can be constructed is, of course, a challenging undertaking. Recent work in systems biology has demonstrated that stochastic hybrid dynamical systems (SHDS) provide a useful mathematical formalism with which to represent biological network dynamics that possess multiple temporal and spatial scales [29–33]. An SHDS is a feedback interconnection of a discretestate stochastic process, such as a Markov chain, with a family of continuousstate stochastic dynamical systems [34]. Thus the discrete system dynamics depends on the continuous system state, perhaps because different regions of the continuous state space are associated with different matrices of Markov state transition probabilities, and the particular continuous system which is “active” at a given time depends on the discrete system state. Combining discrete and continuous dynamics in this way provides an effective framework for modeling the dynamics of the complex, highlyevolved networks that are ubiquitous in biological systems [35]. For example, the rigorous yet tractable integration of switching behavior with continuous dynamics enabled by the SHDS model allows accurate and efficient representation of biological phenomena evolving over disparate temporal scales [29–31] and spatial scales [32, 33].
Inspired by this work, in this paper we apply the SHDS framework to social diffusion dynamics evolving over multiple network scales. Appendix One provides a detailed discussion of the proposed SHDS social diffusion model and demonstrates the effectiveness with which this formalism captures multiscale network dynamics. As an intuitive illustration of the way SHDS enable complex network phenomena to be efficiently represented, consider the task of modeling diffusion on a network that possesses community structure. As shown in Figure 1, this diffusion consists of two components: 1.) intracommunity dynamics, involving frequent interactions between individuals within the same community and the resulting gradual change in the concentrations of “infected” (red) individuals, and 2.) intercommunity dynamics, in which the “infection” jumps from one community to another, for instance because an infected individual “visits” a new community. SHDS models offer a natural framework for representing these dynamics, with the SHDS continuous system modeling the intracommunity dynamics (e.g., via stochastic differential equations), the discrete system capturing the intercommunity dynamics (e.g., using a Markov chain), and the interplay between these dynamics being represented by the SHDS feedback structure. A detailed description of the manner in which SHDS models can be used to capture social diffusion on networks with realistic topologies is given in Appendix One.
2.3 Predictability Assessment
One hallmark of social diffusion processes is their ostensible unpredictability: phenomena from hits and flops in cultural markets to financial system bubbles and crashes to political upheavals appear resistant to predictive analysis (although there is no shortage of ex post explanations for their occurrence!). It is not difficult to gain an intuitive understanding of the basis for this unpredictability. Individual preferences and susceptibilities are mapped to collective outcomes through an intricate, dynamical process in which people react individually to an environment consisting largely of others who are reacting likewise. Because of this feedback dynamics, the collective outcome can be quite different from one implied by a simple aggregation of individual preferences; standard prediction methods, which typically are based on such aggregation ideas, do not capture these dynamics and therefore are often unsuccessful.
This section provides a brief, intuitive introduction to a systematic approach to assessing the predictability of social diffusion processes and identifying process observables which have exploitable predictive power (see Appendix Two, and also [17, 39], for the mathematical details). Consider a simple model for product adoption, in which individuals combine their own preferences and opinions regarding the available options with their observations of the actions of others to arrive at their decisions about which product to adopt. As discussed above, it can be quite difficult to determine which characteristics of the process by which adoption decisions propagate, if any, are predictive of things like the speed or ultimate reach of the propagation [15–17]. In Appendix Two we propose a mathematically rigorous approach to predictability assessment which, among other things, permits identification of features of social dynamics which should have predictive power. We now summarize this assessment methodology.
The basic idea behind the proposed approach to predictability analysis is simple and natural: we assess predictability by answering questions about the reachability of diffusion events. To obtain a mathematical formulation of this strategy, the behavior about which predictions are to be made is used to define the system state space subsets of interest (SSI), while the particular set of candidate measurables under consideration allows identification of the candidate starting set (CSS), that is, the set of states and system parameter values which represent initializations that are consistent with, and equivalent under, the presumed observational capability. As a simple example, consider an online market with two products, A and B, and suppose the system state variables consist of the current market share for A, ms(A), and the rate of change of this market share, r(A) (ms(B) and r(B) are not independent state variables because ms(A) + ms(B) = 1 and r(A) + r(B) = 0); let the parameters be the advertising budgets for the products, bud(A) and bud(B). The producer of item A might find it useful to define the SSI to reflect market share dominance by A, that is, the subset of the twodimensional state space where ms(A) exceeds a specified threshold (and r(A) can take any value). If only market share and advertising budgets can be measured then the CSS is the onedimensional subset of stateparameter space consisting of the initial magnitudes for ms(A), bud(A), and bud(B), with r(A) unspecified (the onedimensional “uncertainty” in the CSS reflects the fact that r(A) is not measurable).
Roughly speaking, the proposed approach to predictability assessment involves determining how probable it is to reach the SSI from a CSS and deciding if these reachability properties are compatible with the prediction goals. If a system’s reachability characteristics are incompatible with the given prediction question – if, say, “hit” and “flop” states in the online market example are both fairly likely to be reached from the CSS – then the situation is deemed unpredictable. This setup permits the identification of candidate predictive measurables: these are the measurable states and/or parameters for which predictability is most sensitive (see Appendix Two). Continuing with the online market example, if trajectories with positive early market share rates r(A) are much more likely to yield market share dominance for A than are trajectories with negative early r(A), then the situation is unpredictable (because the outcome depends sensitively on r(A) and this quantity is not measured). Moreover, this analysis suggests that market share rate is likely to possess predictive power, so it may be possible to increase predictability by adding the capacity to measure this quantity.
A key element of this approach to predictability assessment is the proposed method of estimating the probability of reaching the SSI from a CSS. Note that in a typical assessment such estimates must be computed for several CSS in order to adequately explore the space of candidate predictive features, so that it is crucial to perform these estimates efficiently. In Appendix Two we develop an “altitude function” approach to this reachability problem, in which we seek a scalar function of the system state that permits conclusions to be made regarding reachability without computing system trajectories. We refer to these as altitude functions to provide an intuitive sense of their analytic role: if some measure of “altitude” is low on the CSS and high on an SSI, and if the expected rate of change of altitude along system trajectories is nonincreasing, then it is unlikely for trajectories to reach this SSI from the CSS. Moreover, the difference in altitudes between the CSS and SSI gives a measure of the probability of reaching the latter from the former. Because the reach probability is computed for sets of states without simulating system trajectories, the altitude function method offers an extremely efficient way to explore the space of candidate predictive features.
We have applied the predictability assessment methodology summarized above to the social diffusion prediction problem, and we now summarize the main conclusions of this study; a more complete discussion of this investigation is given in Appendix Two. The analysis uses the mathematically rigorous predictability assessment procedure summarized above, in combination with empiricallygrounded SHDS models for social dynamics, to characterize the predictability of social diffusion on networks with realistic degree distributions, transitivity, community structure, and coreperiphery structure. The main finding of the study, from the perspective of the present paper, is that the predictability of these diffusion models depends crucially upon social and information network topology, and in particular on the community and coreperiphery structures of these networks.
In order to describe these theoretical results more quantitatively and leverage them for prediction, it is necessary to specify mathematical definitions for network communities and coreperiphery structure. There exist several qualitative and quantitative definitions for the concept of community structure in networks. Here we adopt the modularitybased definition proposed in [40], whereby a good partitioning of a network’s vertices into communities is one for which the number of edges between putative communities is smaller than would be expected in a random partitioning. To be concrete, a modularitybased partitioning of a network into two communities maximizes the modularity Q, defined as
where m is the total number of edges in the network, the partition is specified with the elements of vector s by setting s_{i} = 1 if vertex i belongs to community 1 and s_{i} = −1 if it belongs to community 2, and the matrix B has elements B_{ij} = A_{ij} − k_{i}k_{j} / 2m, with A_{ij} and k_{i} denoting the network adjacency matrix and degree of vertex i, respectively. Partitions of the network into more than two communities can be constructed recursively [40]. Note that modularitybased community partitions can be efficiently computed for large social networks, and can be constructed even with incomplete network topology data [39].
With this definition in hand, we are in a position to present the first candidate predictive feature nominated by the theoretical predictability assessment: the presence of early diffusion activity in numerous distinct network communities should be a reliable predictor that the ultimate reach of the diffusion will be large (see Appendix Two). In what follows, propagation dynamics which possess this characteristic will be said to exhibit significant early dispersion across network communities. Note that this measure should be more predictive than the early volume of diffusion activity (the latter has recently become a fairly standard measure e.g., [19, 20]). A cartoon illustrating the basic idea behind this result is given in Figure 2.
Analogously to the situation with network communities, there exists a wide range of qualitative and quantitative descriptions of the coreperiphery structure found in realworld networks. Here we adopt the characterization of network coreperiphery which results from kshell decomposition, a wellestablished technique in graph theory that is summarized in, for instance, [41]. To partition a network into its kshells, one first removes all vertices with degree one, repeating this step if necessary until all remaining vertices have degree two or higher; the removed vertices constitute the 1shell. Continuing in the same way, all vertices with degree two (or less) are recursively removed, creating the 2shell. This process is repeated until all vertices have been assigned to a kshell. The shell with the highest index, the k_{max}shell, is deemed to be the core of the network.
Given this definition, we are in a position to report the second candidate predictive feature nominated by our theoretical predictability assessment: early diffusion activity within the network k_{max}shell should be a reliable predictor that the ultimate reach of the diffusion will be significant (see Appendix Two). In particular, this measure should be more predictive than the early volume of diffusion activity. An intuitive illustration of this result is depicted in Figure 3.
2.4 Early Warning Method
We are now in a position to present an early warning method which is capable of accurately predicting, very early in the lifecycle of a diffusion process of interest, whether or not the process will propagate widely. We adopt a machine learningbased classification approach to this problem: given a triggering incident, one or more information sources which reflect the reaction to this trigger by a population of interest, and a definition for what constitutes an “alarming” reaction, the goal is to learn classifier that accurately predicts, as early as possible, whether or not reaction to the event will ultimately become alarming. The classifier used in the empirical studies described in this paper is the Avatar ensembles of decision trees (AEDT) algorithm [42]. Other classification algorithm were also explored to allow the robustness of the proposed early warning approach to be evaluated, and these alternative methods produced qualitatively similar results [39]. Prediction accuracy in all tests is estimated using standard Nfold crossvalidation, in which the set of diffusion events of interest is randomly partitioned into N subsets of equal size, and the AEDT algorithm is successively “trained” on N−1 of the subsets and “tested” on the heldout subset in such a way that each of the N subsets is used as the test set exactly once.
A key aspect of the proposed approach to early warning analysis is determining which characteristics of the social diffusion event of interest, if any, possess exploitable predictive power. We consider three classes of features:

intrinsicsbased features – measures of the inherent properties and attributes of the “object” being diffused;

simple dynamicsbased features – metrics which capturing simple properties of the diffusion dynamics, such as the early extent of the diffusion and the rate at which the diffusion is propagating;

network dynamicsbased features – measures that characterize the way the early diffusion is progressing relative to topological properties of the underlying social and information networks (e.g., community structure).
Consider, as an illustrative example, the diffusion of “memes”, that is, short textual phrases which propagate relatively unchanged online (e.g., ‘lipstick on a pig’). Suppose it is of interest to predict which memes will “go viral”, appearing in thousands of blog posts, and which will not. In this case, intrinsicbased features could include language measures, such as the sentiment or emotion expressed in the text surrounding the memes in blog posts or news articles. Simple dynamicsbased features for memes might measure the cumulative number of posts or articles mentioning the meme of interest at some early time τ and the rate at which this volume is increasing. Network dynamicsbased features might count the cumulative number of network communities in a blog graph G_{B} that contain at least one post which mentions the meme by time τ and the number of blogs in the k_{max}shell of G_{B} that, by time τ, contain at least one post mentioning the meme. Alternatively, in the case of an epidemic, the intrinsicbased features could include the infectivity of the pathogen, simple dynamicsbased features might capture the number of individuals infected by the disease in the early stages of the outbreak, and network dynamicsbased features could include metrics that characterize the way the epidemic is progressing over the communities of relevant social and transportation networks.
The proposed approach to early warning analysis is to collect features from these classes for the event of interest, input the feature values to the (trained) AEDT classifier, and then run the classifier to generate the warning prediction (i.e., a forecast that the event is expected to become ‘alarming’ or remain ‘not alarming’). In the algorithm presented below this procedure in specified in general terms; more specific instantiations of the procedure are presented in the discussions of the three case studies in Section 3. In what follows it is assumed that the primary source of information concerning the event of interest is social media, as that is emerging as a very useful data source for predictive analysis e.g., [17–24, 26, 27]. However, the analytic process is quite similar when other data sources (e.g., intelligence reporting) are employed [24].
Thus we have the following early warning algorithm:
Algorithm EW
Given: a triggering incident, a definition for what constitutes an ‘alarming’ reaction, and a set of social media sites (e.g., blogs) B which are relevant to early warning task.
Initialization: train the AEDT classifier on a set of events which are qualitatively similar to the triggering event of interest and are labeled as ‘alarming’ or ‘not alarming’ according to the definition given above (see the case study discussions for additional details on this training process).
Procedure:

1.
Assemble a lexicon of keywords L that pertain to the triggering event under study.

2.
Conduct a sequence of blog graph crawls and construct a time series of blog graphs G_{B}(t). For the lexicon L and each time period t, label each blog in G_{B}(t) as ‘active’ if it contains a post mentioning any of the keywords in L and ‘inactive’ otherwise.

3.
Form the union G_{B} = ∪_{t}G_{B}(t), partition G_{B} into network communities and into kshells, and map the partition element structure of G_{B} back to each of the graphs G_{B}(t).

4.
Compute the values of appropriate measures for the intrinsics, simple dynamics, and network dynamics features for each of the graphs G_{B}(t).

5.
Apply the AEDT classifier to the available time series of features, that is, the features obtained from the sequence of blog graphs {G_{B}(t_{0}), …, G_{B}(t_{p})}, where t_{0} and t_{p} are the triggering event time and present time, respectively. Issue an early warning alert if the classifier output is ‘alarming’.
We now offer additional details concerning this procedure; more applicationspecific discussions of the methodology are provided in the case studies in Section 3. Identifying appropriate keywords in Step 1 can be accomplished with the help of subject matter experts and also through various automated means (e.g., via meme analysis [27, 38]). Step 2 is by now standard, and various tools exist which can perform these tasks e.g., [43]. In Step 3, blog network communities are identified with a modularitybased community extraction algorithm applied to the blog graph [40], while the decomposition of the graph into its kshells is achieved through standard methods [41]. The particular choices of metrics for the intrinsics, simple dynamics, and network dynamics features computed in Step 4 tend to be problem specific, and typical examples are given in the case studies below. It is worth noting, however, that we have found it useful in a range of applications to quantify the dispersion of activity over the communities of G_{B}(t) using a blog entropy measure BE:
where f_{i}(t) is the fraction of total posts containing one or more keywords and made during interval t which occur in community i. Finally, in Step 5 the feature values obtained in Step 4 serve as inputs to the AEDT classifier and the output is used to decide whether an alert should be issued.
Case Studies
This section applies Algorithm EW to three early warning case studies involving social phenomena that have proved to be both practically important and challenging to analyze: 1.) diffusion of information through social media, 2.) mobilization/protest events response to “triggering” incidents, and 3.) planning/coordination/execution of politicallymotivated cyber attacks.
3.1 Case Study One: Meme Diffusion
The goal of this case study is to apply Algorithm EW to the task of predicting whether or not a given “meme”, that is, a short textual phrase which propagates relatively unchanged online, will “go viral”. Our main source of data on meme dynamics is the publicly available datasets archived at http://memetracker.org[44] by the authors of [38]. Briefly, the archive [44] contains time series data characterizing the diffusion of ~70 000 memes through social media and other online sites during the five month period between 1 August and 31 December 2008. We are interested in using Algorithm EW to distinguish successful and unsuccessful memes early in their lifecycle. More precisely, the task of interest is to classify memes into two groups – those which will ultimately be successful (acquire more than S posts) and those that will be unsuccessful (attract fewer than U posts) – very early in the meme lifecycle.
To support an empirical evaluation of the utility of Algorithm EW for this problems, we downloaded from [44] the time series data for slightly more than 70 000 memes. These data contain, for each meme M, a sequence of pairs (t_{1}, URL_{1})_{M}, (t_{2}, URL_{2})_{M}, …, (t_{T}, URL_{T})_{M}, where t_{k} is the time of appearance of the kth blog post or news article that contains at least one mention of meme M, URL_{k} is the URL of the blog or news site on which that post/article was published, and T is the total number of posts that mention meme M. From this set of time series we randomly selected 100 “successful” meme trajectories, defined as those corresponding to memes which attracted at least 1000 posts during their lifetimes, and 100 “unsuccessful” meme trajectories, defined as those whose memes acquired no more than 100 total posts. It is worth noting that, in assembling the data in [44], all memes which received fewer than 15 total posts were deleted, and that ~50% of the remaining memes have < 50 posts; thus the large majority of memes are unsuccessful by our definition (as well as according to the criteria of most applications [27, 38]).
Two other forms of data were collected for this study: 1.) a large Web graph which includes websites (URLs) that appear in the meme time series, and 2.) samples of the text surrounding the memes in the posts which contain them. More specifically, we sampled the URLs appearing in the time series for our set of 200 successful and unsuccessful memes and performed a Web crawl that employed these URLs as “seeds”. This procedure generated a Web graph, denoted G_{B}, that consists of approximately 550 000 vertices/websites and 1.4 million edges/hyperlinks, and includes essentially all of the websites which appear in the meme time series. To obtain samples of text surrounding memes in posts, we randomly selected ten posts for each meme and then extracted from each post the paragraph which contains the first mention of the meme.
Recall that Algorithm EW employs three types of features: intrinsicsbased, simple dynamicsbased, and network dynamicsbased. We now describe the instantiation of each of these feature classes for the meme problem. Consider first the intrinsicsbased features, which for the meme application become languagebased measures. Each “document” of text surrounding a meme in its (sample) posts is represented by a simple “bag of words” feature vector x∈ℜ^{V}, where the entries of x are the frequencies with which the words in the vocabulary set V appear in the document. A very simple way to quantify the sentiment or emotion of a document is through the use of appropriate lexicons. Let s∈ℜ^{V} denote a lexicon vector, in which each entry of s is a numerical “score” quantifying the sentiment/emotion intensity of the corresponding word in the vocabulary V. The aggregate sentiment/emotion score of document x can be computed as
where 1 is a vector of ones. Thus score(.) estimates the sentiment or emotion of a document as a weighted average of the sentiment or emotion scores for the words comprising the document. (Note that if no sentiment or emotion information is available for a particular word in V then the corresponding entry of s is set to zero.)
To characterize the emotion content of a document we use the Affective Norms for English Words (ANEW) lexicon, which consists of 1034 words that were assigned numerical scores with respect to three emotional “axes” – happiness, arousal, and dominance – by human subjects [45]. Previous work had identified this set of words to bear meaningful emotional content [45]. Positive or negative sentiment is quantified by employing the “IBM lexicon”, a collection of 2968 words that were assigned {positive, negative} sentiment labels by human subjects [46]. This simple approach generates four language features for each meme: the happiness, arousal, dominance, and positive/negative sentiment of the text surrounding that meme in the (sample) posts containing it. As a preliminary test, we computed the mean emotion and sentiment of content surrounding the 100 successful and 100 unsuccessful memes in our dataset. On average the text surrounding successful memes is happier, more active, more dominant, and more positive than that surrounding unsuccessful memes, and this difference is statistically significant (p < 0.0001). Thus it is at least plausible that these four language features may possess some predictive power regarding meme success.
Consider next two simple dynamicsbased features, defined to capture the basic characteristics of the early evolution of meme post volume:

#posts(τ) – the cumulative number of posts mentioning the given meme by time τ (where τ is small relative to the typical lifespan of memes);

post rate(τ) – a simple estimate of the rate of accumulation of such posts at time τ.
Here we adopt a simple finite difference definition for post rate given by post rate(τ) = (#posts(τ) − #posts(τ/2)) / (τ/2); of course, more robust rate estimates could be used.
The simple dynamicsbased measures of early meme diffusion defined above, while potentially useful, do not characterize the manner in which a meme propagates over the underlying social or information networks. Recall that the predictability assessment summarized in Section 2.3 suggests that both early dispersion of diffusion activity across network communities and early diffusion activity within the network core ought to be predictive of meme success. The insights offered by this theoretical analysis motivate the definition of two network dynamicsbased features for meme prediction:

community dispersion(τ) – the cumulative number of network communities in the blog graph G_{B} that, by time τ, contain at least one post which mentions the meme;

#kcore blogs(τ) – the cumulative number of blogs in the k_{max}shell of blog graph G_{B} that, by time τ, contain at least one post which mentions the meme.
These quantities can be efficiently computed using fast algorithms for partitioning a graph into its communities and for identifying a graph’s k_{max}shell [39]. Thus these features are readily computable even for very large graphs.
We now summarize the results of this case study. First, using only the four language features with the AEDT classifier to predict which memes will be successful yields a prediction accuracy of 66.5% (tenfold crossvalidation). Since simply guessing “successful” for all memes gives an accuracy of 50%, it can be seen that these simple language intrinsics are not very predictive. For completeness it is mentioned that the ANEW score for “arousal” and the IBM measure of sentiment are the most predictive of these four features. In contrast, the features characterizing the early network dynamics of memes possess significant predictive power, and in fact are useful even if only very limited early time series is available for use in prediction. More quantitatively, applying Algorithm EW with the four meme dynamics features produces the following results (tenfold crossvalidation):

τ = 12hr, accuracy = 84%, most predictive features: 1.) community dispersion, 2.) #kcore blogs, 3.) #posts;

τ = 24hr, accuracy = 92%, most predictive features: 1.) community dispersion, 2.) post rate, 3.) #posts;

τ = 48hr, accuracy = 94%, most predictive features: 1.) community dispersion, 2.) post rate, 3.) #posts.
These results show that useful predictions can be obtained within the first twelve hours after a meme is detected (this corresponds to 0.5% of the average meme lifespan), and that accurate prediction is possible after about a day or two. Note also that, as has been found with other social dynamics phenomena e.g., [16–18], dynamics features appear to be more predictive than “intrinsics”, at least for the features employed here.
It is worth mentioning that the fact that a particular meme goes viral does not imply that it will influence behavior in the real world. The next two case studies focus on the important issue of behavioral consequences of information diffusion.
3.2 Case Study Two: Mobilization and Protest
There is considerable interest to develop methods for distinguishing successful mobilization and protest events, that is, mobilizations that become large and selfsustaining, from unsuccessful ones early in their lifecycle. It is natural to pose this question as an early warning problem and to approach it using Algorithm EW. In order to examine the efficacy of this approach, we collected together fourteen recent events, each of which appeared at the outset to have the potential to trigger significant protests. This set of events contains seven triggering incidents which ultimately led to substantial mobilization, including massive protests and significant violence, and seven triggers with reactions that subsided quickly with essentially no violence. Taken together, these events provide a useful setting for testing the applicability of Algorithm EW to mobilization/protest phenomena.
The events employed in this study are listed below.
Triggers leading to significant mobilization/protest:

Quran desecration, May 2005;

first Danish cartoons, September 2005 to March 2006;

Egypt DVD release, October 2005;

France riots, October and November 2005;

antiAhmadiyya protests, June and July 2008;

U.S Republican National Convention, September 2008;

Israel/Gaza event, December 2008 to January 2009.
Triggers not leading to significant mobilization/protest:

Abu Ghraib news release, April and May 2004;

Pope lecture, September 2006;

Salman Rushdie knighting, June 2007;

second Danish cartoons, February 2008;

U.S. Democratic National Convention, August 2008,

Bali bombers execution, November 2008;

Jakarta bombings/NM Top blog post, July 2009.
This list is intended merely to identify the fourteen events under study; additional information concerning each incident is given in [39] and the references therein.
As a preliminary examination of the possibility to obtain useful early warning indicators from analysis of social media discussions of these events, we performed Steps 1–4 of Algorithm EW and then plotted the time series for two quantities: 1.) the volume of blog posts mentioning keywords relevant to the events (these keywords were obtained through a simple news search [39]), and 2.) the blog entropy measure BE(t) = −Σ_{i} f_{i}(t) log(f_{i}(t)) associated with the way online mentions of the keywords diffused over the blog graph. Illustrative time series plots are shown in Figure 4. Observe that in the case of the first Danish cartoons event (plot at right) the BE of relevant discussions (blue curve) experiences a dramatic increase a few weeks before the corresponding increase in volume of blog discussions (red curve); this latter increase, in turn, takes place before any violence. In contrast, in the case of the pope event (plot at left), BE of blog discussions is small relative to the cartoons event, and any increase in this measure lags discussion volume. Similar time series plots are obtained for the other twelve events, suggesting that network dynamicsbased features, such as dispersion of discussions across blog network communities, may be a useful early indicator for large mobilization events.
To examine this possibility more carefully, we applied Algorithm EW to the task of distinguishing triggers which led to large protests from those that did not. For simplicity, in this case study we did not use any intrinsicsbased features (e.g., language metrics) in the AEDT classifier, and instead relied upon the four dynamicsbased features defined in Case Study One. In the case of the seven triggering events which led to protest behavior, the blog data made available to Algorithm EW was limited to posts made during the eight week period which ended two weeks before the protests began. For the seven triggers which did not lead to protests, the blog data included all posts collected during the eight week period immediately following the triggering event.
Because the set of events in this case study included only fourteen incidents, we applied Algorithm EW with twofold crossvalidation. More specifically, the set of incidents was randomly partitioned into two equal subsets, the algorithm was trained on one subset of seven incidents and tested on the other subset, and then the roles of the two data sets were switched. In this evaluation Algorithm EW achieved perfect accuracy, correctly distinguishing the ‘protest’ and ‘nonprotest’ triggers. An examination of the predictive power of the four features used as inputs to the AEDT classifier reveals that, as suggested by Figure 4, the community dispersion feature was the most predictive measure.
3.3 Case Study Three: Cyber Attack Early Warning
This case study explores the ability of Algorithm EW to provide reliable early warning for politicallymotivated distributed denialofservice (DDoS) attacks. Toward this end, we first identified a set of Internet “disturbances” that included examples from three distinct classes of events:

1.
successful politicallymotivated DDoS attacks – these are the events for which Algorithm EW is intended to give warning with sufficient lead time to allow mitigating actions to be taken;

2.
natural events which disrupt Internet service – these are disturbances, such as earthquakes and electric power outages, that impact the Internet but for which it is known that no early warning signal exists in social media;

3.
quiet periods – these are periods during which there is social media “chatter” concerning impending DDoS attacks but ultimately no (successful) attacks occurred.
Including in the case study events selected from these three classes is intended to afford a fairly comprehensive test of Algorithm EW. For instance, these classes correspond to 1.) the domain of interest (DDoS attacks), 2.) a set of disruptions which impact the Internet but have no social media warning signal, and 3.) a set of “nonevents” which do not impact the Internet but do possess putative social media warning signals (online discussion of DDoS attacks).
We selected twenty events from these three classes:
Politicallymotivated DDoS attacks:

Estonia event in April 2007;

CNN/China incident in April 2008;

Israel/Palestine conflict event in January 2009;

DDoS associated with Iranian elections in June 2009;

WikiLeaks event in November 2010;

Anonymous v. PayPal, etc. attack in December 2010;

Anonymous v. HBGary attack in February 2011.
Natural disturbances:

European power outage in November 2006;

Taiwan earthquake in December 2006;

Hurricane Ike in September 2008;

Mediterranean cable cut in January 2009;

Taiwan earthquake in March 2010;

Japan earthquake in March 2011.
Quiet periods:
Seven periods, from March 2005 through March 2011, during which there were discussions in social media of DDoS attacks on various U.S. government agencies but no (successful) attacks occurred.
For brevity a detailed discussion of these twenty events is not given here; the interested reader is referred to [39] and the references therein for additional information on these disruptions.
We collected two forms of data for each of the twenty events: cyber data and social data. The cyber data consist of time series of routing updates which were issued by Internet routers during a one month period surrounding each event. More precisely, these data are the Border Gateway Protocol (BGP) routing updates exchanged between gateway hosts in the Autonomous System network of the Internet. The data was downloaded from the publiclyaccessible RIPE collection site [47] using the process described in [48] (see [48] for additional details and background information on BGP routing dynamics). The temporal evolution of the volume of BGP routing updates (e.g., withdrawal messages) gives a coarsegrained measure of the timing and magnitude of large Internet disruptions and thus offers a simple and objective way to characterize the impact of each of the events in our collection. The social data consist of time series of social media mentions of cyber attackrelated keywords and memes detected during a one month period surrounding each of the twenty events. These data were collected using the procedure specified in Algorithm EW.
As in the preceding case study, we performed a preliminary examination of the possibility to obtain useful early warning indicators from analysis of social media discussions by completing Steps 1–4 of Algorithm EW and plotting the time series for two quantities: 1.) the volume of blog posts mentioning keywords relevant to the events (these keywords were obtained through a simple news search [39]), and 2.) the blog entropy measure BE(t) = −Σ_{i} f_{i}(t) log(f_{i}(t)) associated with the way online mentions of the keywords diffused over the blog graph. Illustrative time series plots corresponding to two events in the case study, the WikiLeaks DDoS attack in November 2010 and Japan earthquake in March 2011, are shown in Figure 5. Observe that the time series of BGP routing updates are similar for the two events, with each experiencing a large “spike” at the time of the event. The time series of blog post volume are also similar across the two events, with each showing modest volume prior to the event and displaying a large spike in activity at event time. However, the time series for blog entropy are quite distinct for the two events. Specifically, in the case of the WikiLeaks DDoS the blog entropy (blue curve in Figure 5) experiences a dramatic increase several days before the event, while in the case of the Japan earthquake blog entropy is small for the entire collection period. Similar social media behavior is observed for all events in the case study, suggesting that network dynamicsbased features, such as dispersion of discussions across blog network communities, may be a useful early indicator for large mobilization events.
To examine this possibility more carefully, we applied Algorithm EW to the task of distinguishing the seven DDoS attacks from the thirteen other events in the set. For simplicity, in this case study we did not use any intrinsicsbased features (e.g., language metrics) in the AEDT classifier, and instead relied upon the four dynamicsbased features defined in Case Study One. Because the set of events in this case study included only twenty incidents, we applied Algorithm EW with twofold crossvalidation, exactly as described in Case Study Two. In the case of DDoS events, the blog data made available to Algorithm EW was limited to posts made during the five week period which ended one week before the attack. For the six natural disturbances, the blog data included all posts collected during the six week period immediately prior to the event, while in the case of the seven nonevents, the blog data included the posts collected during a six week interval which spanned discussions of DDoS attacks on U.S. government agencies.
In this evaluation, Algorithm EW achieved perfect accuracy, correctly distinguishing the ‘attack’ and ‘nonattack’ events. If the test is made more difficult, so that the blog data made available to Algorithm EW for attack events is limited to a four week period that ends two weeks before the attack, the proposed approach still achieves 95% accuracy, An examination of the predictive power of the four features used as inputs to the AEDT classifier reveals that, as suggested by Figure 5, the community dispersion feature was the most predictive measure. It is worth emphasizing that, in this case study, accurately distinguishing ‘attack’ from ‘nonattack’ events is equivalent to providing practicallyuseful early warning for attack events, because the data which serves as input to Algorithm EW reflects online discussions that took place prior to the events under investigation.
Conclusions
This paper presents a new approach to early warning analysis for social diffusion events. We begin by introducing a biologicallyinspired SHDS model for social dynamics on multiscale networks, and then perform stochastic reachability analysis with this model to show that the outcomes of social diffusion processes may depend crucially upon the way the early dynamics of the process interacts with the underlying network’s mesoscale topological structures. This theoretical finding provides the foundations for developing a machine learning algorithm that enables accurate early warning analysis for diffusion events. The utility of the warning algorithm, and the power of networkbased predictive metrics, are demonstrated through empirical case studies involving meme propagation, largescale protests events, and politicallymotivated cyber attacks.
Appendix
A1. Appendix One: SHDS Social Diffusion Model
In this Appendix we propose a multiscale structure for modeling social network dynamics, establish a few facts concerning this representation, and introduce an SHDS formulation of the model that is wellsuited for predictive analysis.
A1.1 MultiScale Social Dynamics Model
In many social situations, people are influenced by the behavior of others, for instance because they seek to obtain the benefits of coordinated actions, infer otherwise inaccessible information, or manage complexity in decisionmaking. Processes in which observing a certain behavior increases an individual’s probability of adopting that behavior are often referred to as positive externality processes (PEP), and we use that term here. PEP have been widely studied in the social and behavioral sciences and, more recently, by the informatics and physical sciences communities e.g., [4]. In particular, social scientists have constructed theories which qualitatively and quantitatively explain these processes and their dependence on social networks e.g., [2–4, 6, 18, 36, 49–52]. One result of this research is a recognition that the process by which preferences and opinions of individuals become the collective outcome for a group can be complex and subtle, and thus challenging to model and predict. People arrive at their decisions by reacting individually to an environment consisting largely of others who are reacting likewise, and one consequence of this feedback dynamics is that the collective outcome can be quite different from one implied by a simple aggregation of individual preferences.
We model PEP in a manner which explicitly separates the individual, or “micro”, dynamics from the collective dynamics. More specifically, we adopt a modeling framework consisting of three modeling scales:

a microscale, for modeling the behavior of individuals;

a mesoscale, which represents the interaction dynamics of individuals within the same network partition element (community or core/periphery);

a macroscale, which characterizes the interaction between partition elements.
We now derive a few properties of the multiscale model. The microscale quantifies the way individuals combine their own inherent preferences regarding the available options with their observations of the behaviors of others to arrive at their chosen courses of action. Interestingly, the dependence of this decisionmaking process on the social network admits a straightforward characterization. Consider the common and important binary choice setting, in which N agents choose from a set O = {0,1} of options based in part on the choices made by others. Let o_{i} ∈ {0,1} denote the selection of agent i and o = [o_{1} … o_{N}]^{T} ∈ O^{N} represent the vector of choices made by the group. It is reasonable to suppose that agent i chooses between the options probabilistically according to some map PO_{i}: A_{i} × O^{N} → [0,1], where PO_{i} is the probability that agent i chooses option 1, A_{i} measures i’s inherent preference for option 1, and PO_{i} is nondecreasing in A_{i}. In positive externality situations PO_{i} should also be “nondecreasing in o” in some sense, and we now make this notion precise. (For notational simplicity in what follows we suppress the dependence of PO_{i} on A_{i}.)
Because it is defined in such general terms it may appear that the map PO_{i} could be a very complicated function of the choices of the other agents. In fact, Theorem 1 indicates that this map must be tractable.
Theorem 1: Given any PO_{i} there exists a vector w_{i} = [w_{i1} … w_{iN}]^{T} ∈ ℜ^{N}, with w_{ij}^{3} 0 and Σ_{j} w_{ij} = b_{i}, and a scalar function r_{i}: [0, b_{i}] → [0,1] such that PO_{i}(o) = r_{i}(o^{T}w_{i}).
Proof: It is enough to prove that the w_{ij} can be chosen so o^{T}w_{i}: O^{N} → [0, b_{i}] is injective, since then r_{i} can be constructed to recover any PO_{i}. One such choice for w_{i} is w_{i} = [2^{0} 2^{1} … 2^{N−1}]^{T}, as then o^{T}w_{i} provides a unique (binary number) representation for each o.
We call r_{i} the agent decision function and s_{i} = o^{T}w_{i} agent i’s social signal, and interpret the w_{ij} as defining a weighted social network for the group of N agents. Observe that Theorem 1 quantifies the way social influence is transmitted to an agent by her neighbors and highlights the importance of this signal in the decisionmaking process. The result also allows a simple characterization of positive externality agent behavior: for such behavior, r_{i} is nondecreasing in s_{i}.
The microscale model structure allows PEP behaviors which appear to be distinct to be represented within a unified setting. For example, the basic model readily accommodates two of the most common sources of PEP: 1.) utilityoriented externalities, in which the utility or value of an option is a direct function of the number of others choosing it, and 2.) information externalities, which arise from inferences made by an individual about decisionrelevant information possessed by others.
Example A1.1: utilityoriented externalities. Suppose each agent i has a utility function u_{i}: O × [0, b_{i}] → ℜ^{+} which depends explicitly on i’s social signal s_{i}. The standard, albeit dated, example here is the fax machine, with the utility of owning a fax machine increasing with the number of others who own one. The key quantity considered by agent i when selecting between options 0 and 1 is the utility difference between the options, Δu_{i}(s_{i}) = u_{i}(1,s_{i}) − u_{i}(0,s_{i}). In positive externality situations Δu_{i} is increasing in s_{i}, and there exists a threshold social signal value s*, possibly with s* < 0 or s* > b_{i}, such that a utility maximizing agent will choose option 0 if s_{i} < s* and option 1 if s_{i} ≥ s*.
Example A1.2: information externalities. Suppose the utility to agent i of each option is independent of the number of other agents choosing that option but there exists uncertainty regarding this utility. To be concrete, assume that agent i’s utility depends on the “state of world” w ∈ {w_{0}, w_{1}}, so that u_{i} = u_{i}(o_{i},w), and there exists uncertainty regarding w. In this case, agent i may observe others’ decisions in order to infer w and then choose the option which maximizes his utility for this world state (as when a tourist chooses a crowded restaurant over an empty one in an unfamiliar city). Consider, for instance, the decision of whether to adopt an innovation of uncertain quality, and let the world state w_{1} signify that innovation quality is such that adopting maximizes utility. In this situation it is reasonable for agent i to maximize expected utility and choose the option (adopt or not) o_{i}* = argmax_{o∈O} Σ_{w∈W} P(w  s_{i}) u_{i}(o_{i},w). If agent i uses Bayesian inference to estimate P(w_{1}  s_{i}) then we have a positive externality decision process and there exists a threshold value s* for the social signal such that agent i will choose option 0 if s_{i} < s* and option 1 if s_{i} ≥ s* [17].
It can be seen that in these examples, different positive externality “drivers” lead to equivalent (threshold) microscale models.
Taken together, the meso and macroscale components of the proposed modeling framework quantify the way agent decision functions interact to produce collective behavior at the population level. For convenience of exposition, in this Appendix we focus on network communities as the mesoscale structure of interest; however, all of the modeling results derived here also hold for the case of coreperiphery structure . The role of the mesoscale model is to quantify and illuminate the manner in which agent decision functions interact within social network communities, while the macroscale model characterizes the interactions of agents between communities. The primary assumption is that interactions between individuals within social network communities can be modeled as “fullymixed” – all pairwise interactions between individuals within a network community are equally likely – while interactions between communities are constrained by the network defining the relationships between the communities. We argue below that this assumption is reasonable and useful.
One advantage of identifying a scale at which agent interaction is (approximately) homogeneous is that this enables the leveraging of an extensive literature on collective dynamics. To be concrete, we derive two examples. Consider first the social movement model proposed in [49, 50]. In this model, each individual can be in one of three states: member (of the movement), potential member, and exmember. Individuals interact in a fullymixed way, with each interaction between a potential member and a member resulting in the potential member becoming a member with probability β^{′}, and each interaction between a member and an exmember resulting in the member becoming an exmember with probability δ_{1}^{′}; members also “spontaneously” become exmembers with probability δ_{2}^{′}. The connection between this representation and standard epidemiological models [1] is clear.
Under the assumption of fullymixed interactions at the mesoscale, standard manipulations yield the following representation for the social dynamics within network communities:
where P, M, and E denote the fractions of potential members, members, and exmembers in the community population, β, δ_{1}, and δ_{2} are nonnegative constants related to the probabilities β^{′}, δ_{1}^{′}, and δ_{2}^{′} defined above, and the η_{i}(t) are appropriate random processes e.g., [17]. The deterministic version of this basic model (i.e., with η_{1}(t)=η_{2}(t)=η_{3}(t)≡0) is discussed by Hedstrom and coauthors in [49, 50], and therefore we denote the model Σ_{H}. The deterministic version is shown in [49] to provide a useful description for the local growth of a real world social movement.
The second example incorporates the fact that innovations often have both enthusiasts and skeptics, each of whom may actively attempt to recruit the uncommitted. The model Σ_{H} can be modified to account for this competition in recruitment:
where P and E denote the fractions of potential members and exmembers, as before, M_{1} and M_{2} are members of the competing groups or movements, and β_{1}, β_{2}, δ_{1}, and δ_{1} are nonnegative constants. A model of this basic form is proposed in Bettencourt and coworkers in [51] and thus we label it Σ_{B}. The model can be fitted, with good agreement, to empirical data for the diffusion of Feynman diagrams (an innovation in physics) in the post World War II era [51]. Developing a stochastic version of Σ_{B}, analogous to the representation Σ_{H}, is straightforward [39].
The mesoscale model describes the way individual agent decision functions interact to produce collective behavior within social network communities. Individuals also interact with people from other communities, of course, and receive information from channels that transmit to many communities simultaneously (e.g., mass media). These intercommunity interactions and “global” social signals are quantified at the macroscale level of the multiscale modeling framework. The basic idea is simple and natural: we model interdependence between social network communities with a graph G_{sc} = {V_{sc}, E_{sc}}, where V_{sc} and E_{sc} are the vertex and edge sets, respectively, V_{sc} = K, each vertex v ∈ V_{sc} is a community, and each directed edge e = (v,v^{′}) ∈ E_{sc} represents a potential intercommunity interaction. More specifically, an edge (v,v^{′}) indicates that an agent in community v^{′} can receive decisionrelevant information from one in community v. The way agents act upon this information is specified by their decision functions r_{i}. The broadcast of global social signals to individuals is modeled as a communitydependent input u_{v} to each individual in community v. Thus G_{sc} and the u_{v} define the macroscale model structure.
A key task in deriving a macroscale model is specifying the topology of G_{sc}, as this graph encodes the social network structure for the phenomenon of interest. The most direct approach to constructing G_{sc} is to infer communities directly from social network data, by partitioning the network so as to maximizing the graph modularity Q_{m}. The main challenge with this method for building social community graphs is obtaining the requisite social network data. While this task is certainly nontrivial, availability of such data has increased dramatically over the past decade. For instance, social relationships and interactions increasingly leave “fingerprints” in electronic databases (e.g., communication via email and cell phones, financial transactions), making convenient the acquisition, manipulation, storage, and analysis of these records e.g., [4].
Alternatively, demographics data can sometimes be used to define both the communities themselves (e.g., families, physical neighborhoods) and their proximity. The basic idea is familiar: individuals belong to social groups, which in turn belong to “groups of groups”, and so on, giving rise to a hierarchical organization of communities. For instance, in academics, research groups often belong to academic departments, which are organized into colleges, which in turn form universities, and so on. The proximity of two communities is specified by their relationship within the hierarchy, and this distance defines the likelihood that individuals from the two communities will interact. The probability of intercommunity interaction, in turn, can be used to define the network community graph G_{sc}[39].
A1.2 SHDS Model Formulation
We now show that the stochastic hybrid dynamical system formalism provides a rigorous, tractable, and expressive framework within which to represent multiscale social dynamics models. Consider the following
Definition A1.1: A stochastic hybrid dynamical system (SHDS) is a feedback interconnection of a continuoustime, continuous statedependent Markov chain {Q, Λ(x)} and a collection of stochastic differential equations indexed by the Markov chain state q:
where q∈Q is the discrete state, $x\in X\subseteq {\mathfrak{R}}^{n}$ is the continuous state, p∈ℜ^{p} is a vector of system parameters, {f_{q}} and {G_{q}} are sets of vector and matrix fields characterizing the continuous system dynamics, w is an mvalued Weiner process, and Λ(x) is the matrix of (xdependent) Markov chain transition rates; the entries of Λ(x) satisfy ${\lambda}_{q{q}^{\prime}}\left(x\right)\ge 0\phantom{\rule{0.12em}{0ex}}if\phantom{\rule{0.12em}{0ex}}q\ne {q}^{\prime}$ and ${\sum}_{{q}^{\prime}}{\lambda}_{q{q}^{\prime}}\left(x\right)=0\forall q$, and are related to the standard Markov state transition probabilities as follows e.g., [34]:
A general discussion of SHDS theory and applications is beyond the scope of this paper and may be found in, for instance, [34] and the references therein.
We now develop an SHDS representation for multiscale social diffusion processes. It is assumed that:

the social system consists of N individuals distributed over K network communities;

individuals can influence each other via positive externalities;

intracommunity interactions are fullymixed;

intercommunity interactions involve the (possibly temporary) migration of individuals from one community to another.
The phenomenon of interest is the diffusion of innovations, in which an innovation of some kind (e.g., a new technology or idea) is introduced into a social system, and individuals may learn about the innovation from others and decide to adopt it [e.g., 2]. By definition an innovation is “new”, and therefore it is supposed that initially only a few of the network communities have been exposed to it. An important task in applications is to be able to characterize the likelihood that the innovation will spread to a significant fraction of the population [17].
We model social diffusion as follows:
Definition A1.2: The multiscale SHDS diffusion model is a tuple
where

G_{sc} = {V_{sc}, E_{sc}} is the social network community graph;

Q×X is the system state set, with Q and X ⊆ ℜ^{n} denoting the (finite) discrete and (bounded) continuous state sets, respectively;

{f_{q}(x),G_{q}(x),H_{q}(x)}_{q∈Q}, Par, W, U is the SHDS continuous system, a family of stochastic differential equations which characterizes the intracommunity dynamics via vector field/ matrix families {f_{q}},{G_{q}},{H_{q}}, system parameter vector $p\in Par\subseteq {\mathfrak{R}}^{p}$ , and system inputs $w\in W\subseteq {\mathfrak{R}}^{m},u\in U\subseteq {\mathfrak{R}}^{r}$;

{Q, Λ(x)} is the SHDS discrete system, a continuoustime Markov chain which defines intercommunity interactions via state set Q and transition rate matrix Λ(x).
The social community graph G_{sc} defines the feasible communitycommunity innovation diffusion pathways: if (v,v^{′}) ∉ E_{sc} then it is not possible for the innovation to spread directly from community v to community v^{′}. The discrete state set Q = {0,1}^{K} specifies which communities contain at least one adopter of the innovation by labeling such communities with a ‘1’ (and a ‘0’ otherwise). Thus, for example, state q = [1 0 0 … ]^{T} indicates that community 1 has at least one adopter, community 2 and 3 do not, and so on. The continuous state space X has coordinates x_{ij} ∈ [0,1], where x_{ij} is the ith state variable for the continuous system dynamics evolving in community j. For consistency we use the first coordinate for each community, x_{1j}, to refer to the fraction of adopters for that community. The continuous system dynamics is defined by a family of qindexed stochastic differential equations {∑_{ cs, q }}_{q ∈ Q}, with
where w∈W is a standard Weiner process and u∈U is the exogenous input. Ordinarily w is interpreted as a stochastic “disturbance”, while u is employed to represent influences from “global” sources such as mass media. These dynamics quantify intracommunity diffusion of the innovation of interest, for instance through models of the form Σ_{H}. The Markov chain matrix Λ(x) specifies the transition rates for discrete state transitions q → q^{′} and depends on both G_{sc} and x (e.g., the rate at which community v will “infect” other communities depends upon the fraction of adopters in v). It is worth noting that the model Σ_{SHDS, diff} naturally accommodates both probabilistic (via w and the Markov chain dynamics) and setbounded (through parameter set Par) uncertainty descriptions, as this expressiveness is desirable in applications.
A1.3 A Simple Example
We now demonstrate the implementation of the proposed multiscale SHDS diffusion modeling framework, and illustrate its efficacy, through a simple example; a more complex example, with more interesting analytic goals, is investigated in Appendix Two below. Consider a social network consisting of two communities and a social movement process playing out on this network. We construct the social network using the method given in [52]. Briefly, a collection of N vertices is divided into two communities of equal size, denoted L and R (for ‘left’ and ‘right’, see Figure 6). For all vertex pairs, if both vertices belong to the same community then an edge is placed between them with probability p_{i}, and if the vertices belong to different communities then they are connected with probability p_{e} < p_{i}. Increasing the ratio p_{i} / p_{e} makes the resulting network more “communitylike” by increasing the relative intracommunity edge density. Figure 6 shows two small example networks built in this way, with the network on the left corresponding to a larger p_{i} / p_{e} ratio.
The social movement dynamics evolving on this network is a “network version” of the model proposed in [49]. Thus each individual can be in one of three states – member, potential member, and exmember – and individuals can change states in one of three ways: 1.) members persuade potential members to whom they are linked to become members with probability β^{′}, 2.) exmembers likewise influence neighboring members to become exmembers with probability δ_{1}^{′}, and 3.) members can spontaneously become exmembers with probability δ_{2}^{′}. For convenience of reference this “agentbased” system representation is denoted Σ_{ABM}.
It is straightforward to derive an SHDS version of the social movement model Σ_{ABM}. Consider the diffusion model ∑ _{S − HDS,diff} = {G_{ sc }, Q × X, {f_{ q }(x), G_{ q }(x), H_{ q }(x)}_{q ∈ Q}, Par, W, U, {Q, Λ(x)}} specified in Definition A1.2. Note first that in this case the social network community graph G_{sc} is very simple, consisting of two vertices corresponding to communities L and R and an undirected edge connecting them. The continuous system state is x = [P_{L} M_{L} P_{R} M_{R}]^{T}∈X, where the subs indicate communities (note that the concentrations of exmembers, E_{L} and E_{R}, are not independent states because the total concentration sums to one on each community). We approximate the agentbased social movement dynamics within each network community with the fullymixed model Σ_{H}, that is, with a set of stochastic differential equations governing the evolution of the concentrations of members M and potential members P.
It can be seen that Σ_{H} together with the preceding discussion defines the model components X, {f_{q}(x),G_{q}(x),H_{q}(x)}_{q∈Q}, Par, W, U that make up the continuous system portion of Σ_{SHDS, diff}. Thus all that remains is to specify the discrete system {Q, Λ(x)}. The discrete state set Q = {00, 10, 01, 11} indicates which communities contain at least one movement member, so that for instance state q = 10 indicates that community L has at least one member and community R has no members. The Markov chain matrix Λ(x) specifies the transition rates for discrete state transitions q → q^{′}. These rates depend on the continuous system state x because the likelihood that one community will “infect” the other depends upon the current concentrations of members, potential members, and exmembers in that community.
We examine the utility of the SHDS social diffusion model constructed above by using this model to estimate the probability that a small set of “seed” members introduced into community L will lead to the movement growing and eventually propagating to community R. Because the model Σ_{SHDS, diff} is derived from Σ_{ABM}, Σ_{ABM} is taken to be ground truth and Σ_{SHDS, diff} is deemed a useful approximation if the cascade probability estimates obtained using the SHDS representation are in good agreement with those computed based on Σ_{ABM}. The following parameter values are chosen for Σ_{ABM}: N = 2000, β^{′} = 0.5, δ_{1}^{′} = 0.01, δ_{2}^{′} = 0.1 (the results reported are not sensitive to variation in these values). We build 50 random realizations of the social network for each of 15 p_{i} / p_{e} ratios. The values for p_{i} / p_{e} are selected to generate a collection of 15 network sets whose topologies interpolate smoothly between networks with essentially disconnected communities (large p_{i} / p_{e}) and networks whose two communities are tightly coupled (small p_{i} / p_{e}). A “global” cascade is said to occur if an initial seed set of five movement members in community R, chosen at random, results in the diffusion of the movement to community L. The probability of global cascade at a given p_{i} / p_{e} ratio is computed by running 20 simulations on each of the 50 social network realizations associated with that p_{i} / p_{e}, and counting up those for which the innovation propagates to community L. The results of this simulation study are presented in the plot at the bottom of Figure 6, with the blue curve showing the probability estimates as a function of p_{i} / p_{e} ratio and the error bars corresponding to ± 2 standard errors.
We now investigate the efficacy of the SHDS social diffusion model by using this model to estimate the probability of global cascade. The social diffusion model Σ_{SHDS, diff} is instantiated to be equivalent to the agentbased representation Σ_{ABM} described above. Note that, in particular, there are no free parameters available to permit the response of Σ_{SHDS, diff} to be “tuned” to match Σ_{ABM}. For instance, the Σ_{ABM} parameters β^{′}, δ_{1}^{′}, δ_{2}^{′} uniquely define Σ_{SHDS, diff} parameters β, δ_{1}, δ_{2}, and specifying values for the p_{i} / p_{e} ratios gives corresponding values for the SHDS transition matrices Λ(x) (to within a single “offset” parameter, see [39]). A Matlab program implementing the resulting model Σ_{SHDS, diff} is given in [39].
In order to compute the probability of global cascade using the SHDS model Σ_{SHDS, diff}, we employ the “altitude function” method described in Appendix Two below. This method calculates provablycorrect upper bounds on the probability of the social movement propagating to community L. The results of this analysis are given at the plot of the bottom of Figure 6 (red curve). Observe that the global cascade probability estimates obtained using the two models Σ_{ABM} and Σ_{SHDS, diff} are in close agreement. As it is challenging to model “discontinuous” phenomena such as diffusion across social network communities, this agreement represents important evidence that the SHDS provides a useful characterization of social diffusion on networks.
While the models Σ_{ABM} and Σ_{SHDS, diff} generate similar results in this example, the SHDS representation is much more efficient computationally. For instance, estimating the desired global cascade probabilities using the SHDS model requires less than one percent of the computer time needed to obtain these estimates with the equivalent agentbased model. Moreover, this difference on efficiency increases with network size, which is important because realistic social networks have hundreds or thousands of communities rather than just two. This computational tractability hints at a more general, and more significant, mathematical tractability enjoyed by the SHDS framework, a property we now leverage to develop a rigorous predictive analysis methodology for social diffusion events.
A2. Appendix Two: Predictive Analysis
In this Appendix we formulate the predictive analysis problem in terms of reachability assessment, show that these reachability questions can be addressed through an “altitude function” analysis without computing system trajectories, and apply this theoretical framework to demonstrate that predictability of a broad class of social diffusion models depends crucially upon the mesoscale topological structures of the underlying networks. For convenience of exposition, in this Appendix we focus on network communities as a representative mesoscale structure; however, all results derived here are also applicable to the more general case in which the “network partition” (see Section 2.2) includes both community and coreperiphery structures.
A2.1 Predictive Analysis as Reachability Assessment
We propose that accurate prediction requires careful consideration of the interplay between the intrinsics of a process and the social dynamics which are its realization. We therefore adopt an inherently dynamical approach to predictive analysis: given a social process, a set of measurables, and the behavior of interest, we formulate prediction problems as questions about the reachability properties of the system. Toward that end, the behavior about which predictions are to be made is used to define the system state space subsets of interest (SSI), while the particular set of candidate measurables under consideration allows identification of the candidate starting set (CSS), that is, the set of states and system parameter values which represent initializations that are equivalent under the assumed observational capability. This setup permits predictability assessment, and the related task of identifying useful measurables, to be performed in a systematic manner. Roughly speaking, the proposed approach to predictability assessment involves determining how probable it is to reach the SSI from a CSS and deciding if these reachability properties are compatible with the prediction goals. If a system’s reachability characteristics are incompatible with the given prediction question – if, say, “hit” and “flop” in a cultural market are both likely to be reached from the CSS – then the prediction objectives should be refined in some way. Possible refinements include relaxing the level of detail to be predicted or introducing additional measurables.
We now make these notions more precise. Consider the multiscale SHDS social diffusion model Σ_{SHDS, diff} specified in Definition A1.2. Let P_{0} be a subset of the parameter set Par and X_{0}, X_{s1}, X_{s2} be subsets of the (bounded) continuous system state space X. Suppose X_{0} × P_{0} and {X_{s1}, X_{s2}} are the CSS and SSI, respectively, corresponding to the prediction question. Let a specification δ > 0 be given for the minimum acceptable level of variation in system behavior relative to {X_{s1}, X_{s2}}. Consider the following
Definition A2.1: A situation is eventual state (ES) predictable if γ_{1} − γ_{2} > δ , where γ_{1} and γ_{2} are the probabilities of Σ_{SHDS, diff} reaching X_{s1} and X_{s2}, respectively, and is ES unpredictable otherwise.
Note that in ES predictability problems it is expected that the two sets {X_{s1}, X_{s2}} represent qualitatively different system behaviors (e.g., hit and flop in a cultural market), so that if the probabilities of reaching each from X_{0} × P_{0} are similar then system behavior is unpredictable in a sense that is meaningful for many applications. Other useful forms of predictability are defined and investigated in [39].
The notion of predictability forms the basis for our definition of useful measurables:
Definition A2.2: Let the components of the vectors (x_{0}, p_{0}) ∈ X_{0} × P_{0} which comprise the CSS be denoted x_{0} = [x_{01} … x_{0n}]^{T} and p_{0} = [p_{01} … p_{0p}]^{T}. The measurables with most predictive power are those state variables x_{0j} and/or parameters p_{0k} for which predictability is most sensitive.
Intuitively, those measurables for which predictability is most sensitive are likely to be the ones that can most dramatically affect the predictability of a given problem. Note that we do not specify a particular measure of sensitivity to be used when identifying measurables with maximum predictive power, as such considerations are ordinarily applicationdependent (see [39] for some useful specifications). Definitions A2.1 and A2.2 focus on the role played by initial states in the predictability of social processes. In some cases it is useful to expand this formulation to allow consideration of states other than initial states. For instance, we show in [18] that very early time series are often predictive for PEP, suggesting that it can be valuable to consider initial state trajectory segments, rather than just initial states, when assessing predictability. This extension can be naturally accomplished by redefining the CSS, for instance by augmenting the state space X with an explicit time coordinate [18].
We now turn our attention to the “early warning” problem.
Definition A2.3: Let the event of interest be specified in terms of Σ_{SHDS, diff} reaching or escaping some SSI X_{s}, and suppose a warning signal is to be issued only if the probability of event occurrence exceeds some specified threshold α. Reach warning analysis involves identifying a state set X_{w}, where X_{s} ⊆ X_{w} necessarily, with the property that if the system trajectory enters X_{w} then the probability that Σ_{SHDS, diff} will eventually reach X_{s} is at least α. Analogously, escape warning analysis involves identifying a state set X_{w}, where X \ X_{w} ⊆ X_{s} necessarily, with the property that if the system trajectory enters X_{w} then the probability that Σ_{SHDS, diff} will eventually escape from X_{s} is at least α.
A2.2 Stochastic Reachability Assessment
The previous section formulates predictive analysis problems as reachability questions. Here we show that these reachability questions can be addressed through an “altitude function” analysis, in which we seek a scalar function of the system state that permits conclusions to be made regarding reachability without computing system trajectories. We refer to these as altitude functions to provide an intuitive sense of their analytic role: if some measure of “altitude” is low on the CSS and high on an SSI, and if the expected rate of change of altitude along system trajectories is nonincreasing, then it is unlikely for trajectories to reach this SSI from the CSS.
Consider the SHDS social diffusion model Σ_{SHDS, diff} evolving on a bounded state space Q × X. We quantify the uncertainty associated with Σ_{SHDS, diff} by specifying bounds on the possible values for some system parameters and perturbations and giving probabilistic descriptions for other uncertain system elements and disturbances. Given this representation, it is natural to seek a probabilistic assessment of system reachability.
We begin with an investigation of probabilistic reachability on infinite time horizons. The following “supermartingale lemma” is proved in [53] and is instrumental in our development:
Lemma SM: Consider a stochastic process Σ_{s} with bounded state space X, and let x(t) denote the “stopped” process associated with Σ_{s} (i.e., x(t) is the trajectory of Σ_{s} which starts at x_{0} and is stopped if it encounters the boundary of X). If A(x(t)) is a nonnegative supermartingale then for any x_{0} and λ > 0
Denote by X_{0} ⊆ X and X_{s} ⊆ X the initial state set and SSI, respectively, for the continuous system component of Σ_{SHDS, diff}, and assume that X and the parameter set Par ⊆ ℜ^{p} are both bounded. Thus, for instance, the SSI is a subset of the continuous system state space X alone; this is typically the case in applications and is easily extended if necessary. We are now in a position to state our first stochastic reachability result:
Theorem 2: γ is an upper bound on the probability of trajectories of Σ_{SHDS, diff} reaching X_{s} from X_{0}, while remaining in Q × X, if there is a family of differentiable functions {A_{q}(x)}_{q∈Q} such that•
•
•
•
Proof: Note first that $B{A}_{q}\left(x\right)=\left(\partial {A}_{q}/\partial x\right)\left({f}_{q}+{H}_{q}u\right)+\left(1/2\right)tr\left[{{G}_{q}}^{T}\left({\partial}^{2}{A}_{q}/\partial {x}^{2}\right){G}_{q}\right]+{\sum}_{{q}^{\prime}\in Q}{\lambda}_{q{q}^{\prime}}{A}_{{q}^{\prime}}$ is the infinitesimal generator for Σ_{SHDS, diff}, and therefore quantifies the evolution of the expectation of A_{q}(x) [34, 53]. As a consequence, the third and fourth conditions of the theorem imply that A(q(t),x(t)) is a nonnegative supermartingale [53]. Thus, from Lemma SM, we can conclude that P{x(t) ∈ X_{ s } for some t} ≤ P{sup A(q(t), x(t)) ≥ 1  x(0) = x_{0}} ≤ A(q, x_{0}) ≤ γ ∀ x_{0} ∈ X_{0}, ∀ q ∈ Q, ∀ u ∈ U, ∀ p ∈ Par. □
The preceding result characterizes reachability of SHDS on infinite time horizons. In some situations, including important applications involving social systems, it is of interest to study system behavior on finite time horizons. The following result is useful for such analysis:
Theorem 3: γ is an upper bound on the probability of trajectories of Σ_{SHDS, diff} reaching X_{s} from X_{0} during time interval [0,T], while remaining in Q × X, if there exists a family of differentiable functions {A_{q}(x,t)}_{q∈Q} such that•
•
•
•
Proof: The proof follows immediately from that of Theorem 2 once it is observed that $P\left\{\underset{\u2015}{x}\left(t\right)\in {X}_{s}\text{for}\phantom{\rule{0.12em}{0ex}}\text{some}\phantom{\rule{0.12em}{0ex}}t\in \left[0,t\right]\right\}=P\left\{\left(\underset{\u2015}{x}\left(t\right),t\right)\in {X}_{s}\times \left[0,T\right]\right\}$.
The idea for the proof of Theorem 3 was suggested in [54].
Having formulated predictability assessment for social processes in terms of system reachability and presented a new theoretical methodology for assessing reachability, we are now in a position to give our approach to deciding predictability. Observe first that Theorems 2 and 3 are of direct practical interest only if it is possible to efficiently compute a tight probability bound γ and associated altitude function A(x) which satisfy the theorem conditions. Toward that end, observe that the theorems specify convex conditions to be satisfied by altitude functions: if A_{1} and A_{2} satisfy the theorem conditions then any convex combination of A_{1} and A_{2} will also satisfy the conditions. Thus the search for altitude functions can be formulated as a convex programming problem [55]. Moreover, if the system of interest admits a polynomial description (e.g., the system vector and matrix fields are polynomials) and we search to polynomial altitude functions, then the search can be carried out using sumofsquares (SOS) optimization [56].
SOS optimization is a convex relaxation framework based on SOS decomposition of the relevant polynomials and semidefinite programming. SOS relaxation involves replacing the nonnegative and nonpositive conditions to be satisfied by the altitude functions with SOS conditions. For example, the conditions for A_{q}(x) given in Theorem 2 can be relaxed as follows:
where the entries of the vector functions λ_{0}, λ_{ s }, λ_{x 1}, λ_{x 2}, λ_{ p } are SOS, the vector functions g_{0}, g_{ s }, g_{x 1}, g_{x 2}, g_{ p } satisfy g*(·) ≥ 0 (entrywise) whenever x∈X* or p∈Par, respectively, and we assume Q = 1 for notational convenience. The conditions on A_{q}(x,t) specified in Theorem 3 can be relaxed in exactly the same manner. The relaxed SOS conditions are clearly sufficient and in practice are typically not overlyconservative [39, 56].
Once the set of conditions to be satisfied by A(x) are relaxed in this way, SOS programming can be used to compute γ_{min}, the minimum value for the probability bound γ, and A(x), the associated altitude function which certifies the correctness of this bound. Software for solving SOS programs is available as the thirdparty Matlab toolbox SOSTOOLS [56], and example SOS programs are given in [39]. Importantly, the approach is tractable: for fixed polynomial degrees, the computational complexity of the associated SOS program grows polynomially in the dimension of the continuous state space, the cardinality of the discrete state set, and the dimension of the parameter space.
For completeness, we outline an algorithm for computing the pair (γ_{min}, A(x)):
Algorithm A2.1: altitude functions via SOS programming (outline)

1.
Parameterize A as A(x) = Σ_{k} c_{k} a_{k}(x), where {a_{1}, …, a_{B}} are monomials up to a desired degree bound and {c_{1}, …, c_{B}} are tobedetermined coefficients.

2.
Relax all A(x) criteria in the relevant theorem to SOS conditions.

3.
Formulate an SOS program with decision variables γ, {c_{1}, …, c_{B}}, where the desired bound on altitude function polynomial degree is reflected in the specification of the set {c_{1}, …, c_{B}}. Compute the minimum probability bound γ_{min} and values for the coefficients {c_{1}, …, c_{B}} that define A(x) using SOSTOOLS.
It is emphasized that, although the computation of (γ_{min}, A(x)) is performed numerically, the resulting function A(x) is guaranteed to satisfy the conditions of the relevant theorem and therefore represents a proof of the correctness of the probability upper bound γ_{min}. Note also that the probability estimate is obtained without computing system trajectories, and is valid for entire sets of initial states X_{0}, parameter values Par, and exogenous inputs U.
Having given a method for efficiently computing pairs (γ_{min}, A(x)), and thereby characterizing reachability, we are now in a position to sketch an algorithm for assessing ES predictability:
Algorithm A2.2: ES predictability (outline)
Given: social diffusion process of interest is ∑ _{S − HDS,diff}, CSS = X_{0} × P_{0}, SSI = {X_{s 1}, X_{s 2}} and minimum acceptable level of variation = δ.
Procedure:

1.
compute (upper bound for) probability γ_{1} of Σ_{SHDS, diff}, reaching X_{s1} from X_{0}× P_{0};

2.
compute (upper bound for) probability γ_{2} of Σ_{SHDS, diff}, reaching X_{s2} from X_{0}× P_{0};

3.
if γ_{1} − γ_{2} > δ then problem is ES predictable, else problem is ES unpredictable.
Note: γ_{1}, γ_{2} can be computed using Theorem 2 (infinite time horizon) or Theorem 3 (finite time horizon) together with Algorithm3.1 and SOSTOOLS [56].
A2.3 Application to Social Diffusion
The theoretical framework developed in the preceding sections is now used, in combination with empiricallygrounded models for social diffusion e.g., [17, 49–51], to demonstrate that predictability of this class of diffusion models depends crucially upon network community structure. We investigate the following predictability question: Is the diffusion of social movements and mobilizations ES predictable and, if so, which measurable quantities have predictive power?
We adopt a specific version of the SHDS social diffusion model proposed in Definition 2.2:
where

the social network community graph G_{sc} consists of K communities (so V_{sc} = K), connected together with an ErdosRenyi random graph topology, with community size drawn from a power law distribution [36];

each continuous system ∑ _{ cs, q } : dx = f_{ q }(x, p)dt + G_{ q }(x, p)dw, q ∈ Q is given by the mesoscale social movement model Σ_{H} or Σ_{B} with appropriate parameter vector p and system “noise” w;

the discrete system {Q, Λ(x)} is a Markov chain that defines intercommunity interactions in the manner described in Definition A1.2.
A Matlab instantiation of this SHDS diffusion model is given in [39] and is available upon request. The behavior of the model can be shown to be consistent with empirical observations of several historical social movements (e.g., various movements in Sweden) [39].
In order to assess ES predictability, SSI = {X_{s1}, X_{s2}} is defined so that X_{s1}, X_{s2} are state sets corresponding to global (affecting a significant fraction of the population) and local (remaining confined to a small fraction of the population) movement events, respectively. We then employ Algorithm A2.2 iteratively to search for a definition for CSS = X_{0} × P_{0} which ensures that the probabilities of reaching X_{s1} and X_{s2} from X_{0} × P_{0} are sufficiently different to yield an ES predictable situation. We use two models of the form Σ_{SHDS, diff} for this analysis, corresponding to the two definitions for the continuous system Σ_{H} and Σ_{B}. Each model is composed of K = 10 communities connected together with an ErdosRenyi random graph topology. (Using different realizations of the ErdosRenyi random graph does not affect the conclusions reported below.)
ES predictability analysis yields two main results. First, both the intracommunity and intercommunity dynamics exhibit threshold behavior: small changes in either the intracommunity “infectivity” or intercommunity interaction rate around their threshold values lead to large variations in the probability that the movement will propagate “globally”. More quantitatively, for the diffusion model Σ_{SHDS, diff} with continuous system dynamics Σ_{H}, threshold behavior is obtained when varying 1.) the generalized reproduction number R = β / δ_{2} and 2.) the rate λ at which intercommunity interactions between individuals take place. Thus in order for a social movement to propagate to a significant fraction of the population, the threshold conditions R ≥ 1 and λ ≥ λ_{0} must be satisfied simultaneously. An analogous conclusion holds when Σ_{H} is replaced with the diffusion model Σ_{B} in the SHDS representation. This finding is reminiscent of and extends wellknown results for epidemic thresholds in disease propagation models [1].
This threshold behavior is illustrated in the plot at the top right of Figure 7, which shows the way probability of global propagation increases with intercommunity interaction rate when the intracommunity diffusion is sufficiently infective (i.e., R ≥ 1). The probabilities which make up this plot represents provablycorrect (upper bound) estimates computed using Theorem 2 and Algorithm A2.1. A similar threshold response is observed when varying intracommunity infectivity R, provided the intercommunity interaction rate satisfies λ ≥ λ_{0}. Importantly, the intercommunity interaction threshold λ_{0} is seen to be quite small, indicating that even a few links between network communities enables rapid diffusion of the movement to otherwise disparate regions of the social network. This result suggests that a useful predictor of movement activity in a given community is the level of movement activity among that community’s neighbors in G_{sc}.
The second main ES predictability result characterizes the way probability of global propagation varies with the number of network communities across which a fixed set of “seed” movement members is distributed. To quantify this dependence, the social movement model Σ_{SHDS, diff} is initialized so that a small fraction of individuals in the population are movement members and the remainder of the population consists solely of potential members. We then vary the way this initial seed set of movement members is distributed across the K network communities, at one extreme assigning all seeds to the same community and at the other spreading the seeds uniformly over all K communities. For each distribution of seed movement members, the probability of global movement propagation is computed using Theorem 2 and Algorithm A2.1. Other than initialization strategy, the model is specified exactly as in the preceding analysis.
The results of this portion of the ES predictability assessment are summarized in the two plots at the bottom of Figure 7. It is seen that for both choices of mesoscale social movement dynamics, Σ_{H} and Σ_{B}, the probability of global movement propagation increases approximately linearly with the number of network communities across which the fixed set of seed members is distributed (here the number of initial members is set to one percent of the total population).
References
 1.
Anderson R, May R: Infectious Diseases of Humans. Oxford University Press, England; 1992.
 2.
Rogers E: Diffusion of Innovations. 5th edition. Free Press, New York; 2003.
 3.
Della Porta D, Diani M: Social Movement. Second edition. Blackwell, Oxford, England; 2006.
 4.
Easley D, Kleinberg J: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, England; 2010.
 5.
Moghadam A: The Globalization of Martyrdom: Al Qaeda, Salafi Jihad, and the Diffusion of Suicide Attacks. Johns Hopkins University Press, Baltimore; 2008.
 6.
Myers D, Oliver P: The opposing forces diffusion model: the initiation and repression of collective violence. Dynamics of Asymmetric Conflict 2008, 1: 164–188. 10.1080/17467580802616947
 7.
Ackerman G, et al.: Anticipating rare events: Can acts of terror, use of weapons of mass destruction, or other high profile acts be anticipated?. US DoD White Paper, Wasshington DC; 2008. November November
 8.
Krueger A, Maleckova J: Attitudes and action: public opinion and the occurrence of international terrorism. Science 2009, 325: 1535–1536.
 9.
Bergin A, Osman S, Ungerer C, Yasin N: Countering internet radicalization in Southeast Asia. Australian Strategic Policy Institute, Sydney; 2009. March March
 10.
Chen H, Yang C, Chau M, Li S (Eds): Intelligence and Security Informatics, Lecture Notes in Computer Science. Springer, Berlin; 2009.
 11.
Proc. 2010 IEEE International Conference on Intelligence and Security Informatics. Vancouver, BC, Canada; 2010. May May
 12.
O’Brien S: Crisis early warning and decision support: contemporary approaches and thoughts on future research. International Studies Review 2010, 12: 87–104. 10.1111/j.14682486.2009.00914.x
 13.
Ward M, Greenhill B, Bakke K: The perils of policy by pvalue: predicting civil conflict. J. Peace Research 2010, 47: 363–375. 10.1177/0022343309356491
 14.
Walls W: Modeling movie success when ‘nobody knows anything’: conditional stabledistribution analysis of film returns. J. Cultural Economics 2005, 29: 177–190. 10.1007/s1082400511565
 15.
Salganik M, Dodds P, Watts D: Experimental study of inequality and unpredictability in an artificial cultural market. Science 2006, 311: 854–856. 10.1126/science.1121066
 16.
Colbaugh R, Glass K: Predictability and prediction of social processes. In Proc. 4th Lake Arrowhead Conference on Human Complex Systems. Arrowhead, CA; 2007. April April
 17.
Colbaugh R, Glass K: “Predictive analysis for social processes I: Multiscale hybrid system modeling, and II: Predictability and warning analysis”. Proc. 2009 IEEE MultiConference on Systems and Control, Saint Petersburg, Russia; 2009.
 18.
Colbaugh R, Glass K, Ormerod P: “Predictability of ‘unpredictable’ cultural markets”. Proc. 105th Annual Meeting of the American Sociological Association, Atlanta, GA; 2010. August August
 19.
Asur S, Huberman B: Predicting the future with social media. Proc. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Toronto, Ontario, Canada; 2010. September September
 20.
Goel S, Hofman J, Lahaie S, Pennock D, Watts D: Predicting consumer behavior with Web search. Proc. National Academy of Sciences USA 2010, 107: 17486–17490. 10.1073/pnas.1005962107
 21.
Bollen J, Mao H, Zeng X: “Twitter mood predicts the stock market”. arXiv preprint; 2010. October October
 22.
Tumasjan A, Sprenger T, Sandner P, Welpe I: “Predicting elections with Twitter: What 140 characters reveal about political sentiment”. Proc. 4th International AAAI Conference on Weblogs and Social Media, Washington, DC; 2010. May May
 23.
Colbaugh R, Glass K: “Early warning analysis for social diffusion events”. Proc. 2010 IEEE International Conference on Intelligence and Security Informatics, Vancouver, BC Canada; 2010.
 24.
Colbaugh R, Glass K, Gosler J: “Some intelligence analysis problems and their graph formulations”. J. Intelligence Community Research and Development 2010. Permanently available on Intelink, Paper 315 Permanently available on Intelink, Paper 315
 25.
Christakis N, Fowler J: Social network sensors for early detection of contagious outbreaks. PLoS ONE 2010, 5: e12948. 10.1371/journal.pone.0012948
 26.
Lerman K, Hogg T: “Using stochastic models to describe and predict social dynamics of Web users”. arXiv preprint; 2010.
 27.
Colbaugh R, Glass K: “Detecting emerging topics and trends via predictive analysis of ‘meme’ dynamics”. Proc. 2011 AAAI Spring Symposium Series, Palo Alto, CA; 2011.
 28.
Colbaugh R, Glass K: “Proactive defense for evolving cyber threats”. Proc. 2011 IEEE International Conference on Intelligence and Security Informatics, Beijing, China; 2011.
 29.
Uhrmacher A, Degering D, Zeigler B: “Discrete event multilevel models for systems biology”. In Trans. Computational Systems Biology. Springer, New York; 2005. LNBI 3380 LNBI 3380
 30.
ElSamad H, Prajna S, Papachristodoulou A, Doyle J, Khammash M: Advanced methods and algorithms for biological networks analysis. Proc. IEEE 2006, 94: 832–853.
 31.
Julius A, Halasz A, Sakar M, Rubin H, Kumar V, Pappas G: Stochastic modeling and control of biological systems: the lactose regulation system of Escherichia coli. IEEE Trans. Automatic Control 2008, 53: 51–65.
 32.
Lygeros J, et al.: Stochastic hybrid modeling of DNA replication across a complete genome. Proc. National Academy of Sciences USA 2008, 105: 12295–12300. 10.1073/pnas.0805549105
 33.
Yuan C, Mao X, Lygeros J: Stochastic hybrid delay population dynamics: wellposed models and extinction. J. Biological Dynamics 2009, 3: 1–21. 10.1080/17513750802020804
 34.
Bujorianu M, Lygeros J, Bujorianu M: “Toward a general theory of stochastic hybrid systems”, eprint. University of Twente, The Netherlands; 2008. March March
 35.
Doyle J, Csete M: “Architecture, constraints, and behavior”. Proc. National Academy of Sciences USA in press in press
 36.
Newman M: The structure and function of complex networks. SIAM Review 2003, 45: 167–256. 10.1137/S003614450342480
 37.
Hastie T, Tibshirani R, Friedman J: The Elements of Statistical Learning. 2nd edition. Springer, New York; 2009.
 38.
Leskovec J, Backstrom L, Kleinberg J: “Memetracking and the dynamics of the news cycle”. Proc. 15th ACM International Conference on Knowledge Discovery and Data Mining, Paris, France; 2009.
 39.
Colbaugh R, Glass K: SAND Report: Prediction of social dynamics via social media analytics. Sandia National Laboratories, Albuquerque; 2011.
 40.
Newman M: Modularity and community structure in networks. Proc. National Academy of Sciences USA 2006, 103: 8577–8582. 10.1073/pnas.0601602103
 41.
Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E: A model of Internet topology using the kshell decomposition. Proc. National Academy of Sciences USA 2007, 104: 11150–11154. 10.1073/pnas.0701175104
 42.
AVATAR http://www.sandia.gov/avatar/, accessed July 2010 AVATAR http://www.sandia.gov/avatar/, accessed July 2010
 43.
Glass K, Colbaugh R: Web analytics for security informatics. Proc. European Intelligence and Security Informatics Conference, Athens, Greece, September; 2011.
 44.
MemeTracker http://memetracker.org, accessed January 2010 MemeTracker http://memetracker.org, accessed January 2010
 45.
Bradley M, Lang P: “Affective norms for English words (ANEW): Stimuli, instruction manual, and affective ratings”. Technical Report C1, University of Florida, United States; 1999.
 46.
Ramakrishnan G, Jadhav A, Joshi A, Chakrabarti S, Bhattacharyya P: Question answering via Bayesian inference on lexical relations. Proc. Annual Meeting of the Association for Computational Linguistics, Sapporo, Japan, July; 2003.
 47.
RIS/RIPE http://data.ris.ripe.net/, last accessed July 2011 RIS/RIPE http://data.ris.ripe.net/, last accessed July 2011
 48.
Glass K, Colbaugh R, Planck M: Automatically identifying the sources of large Internet events. Proc. IEEE International Conference on Intelligence and Security Informatics, Vancouver, Canada, May; 2010.
 49.
Hedstrom P: Explaining the growth patterns of social movements, Understanding Choice, Explaining Behavior. Oslo University Press, Norway; 2006.
 50.
Hedstrom P, Sandell R, Stern C: Mesolevel networks and the diffusion of social movements: the case of the Swedish Social Democratic Party. American J. Sociology 2000, 106: 145–172. 10.1086/303109
 51.
Bettencourt L, CintronArias A, Kaiser D, CastilloChavez C: The power of a good idea: quantitative modeling of the spread of ideas from epidemiological models. Physica A 2006, 364: 513–536.
 52.
Candia J, Mazzitello K: Mass media influence spreading in social networks with community structure. J. Statistical Mechanics 2008, 7: P07007.
 53.
Kushner H: Stochastic Stability and Control. Academic Press, NY; 1967.
 54.
Papachristodoulou A: Personal communication. 2008. May May
 55.
Parrilo P: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, PhD dissertation. California Institute of Technology, United States; 2000.
 56.
SOS/TOOLS http://www.cds.caltech.edu/sostools/, accessed July 2007 SOS/TOOLS http://www.cds.caltech.edu/sostools/, accessed July 2007
Acknowledgements
This research was supported by the U.S. Department of Defense, the U.S. Department of Homeland Security, The Boeing Company, and the Laboratory Directed Research and Development program at Sandia National Laboratories. Fruitful discussions regarding aspects of this work with Curtis Johnson of Sandia National Laboratories, Paul Ormerod of Volterra Partners, and Anne Kao of Boeing are gratefully acknowledged.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
RC and KG designed the research, RC developed the theoretical results, RC and KG developed the computational algorithms and performed the analysis, and RC wrote the paper. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Colbaugh, R., Glass, K. Early warning analysis for social diffusion events. Secur Inform 1, 18 (2012). https://doi.org/10.1186/21908532118
Received:
Accepted:
Published:
Keywords
 Social dynamics
 Predictive analysis
 Early warning
 Protest and mobilization
 Cyber security
 Security informatics