Contagion ? Consider the contagion model in the graph in Figure 8.20 with p = 0.3. (a) Run the contagion model with node 1 initialized at state-1 and the other nodes initialized at state-0. (b) Run the contagion model with node 3 initialized at state-1 and the other nodes initialized at state-0. (c) Contrast the results from (a) and (b) and explain in terms of the cluster densities of the sets of initially state-0 nodes.
The contagion model in Figure 8.20 is a graph-based model that simulates the spread of a certain behavior or state among a set of nodes. The parameter p represents the probability of a node changing its state to match that of one of its neighbors. (a) Running the contagion model with node 1 initialized at state-1 and the other nodes initialized at state-0 would result in the spread of state-1 through the graph, starting from node 1. The cluster density of the set of initially state-0 nodes is high, with many interconnected nodes, which means that the probability of state-1 spreading to them is high. (b) Running the contagion model with node 3 initialized at state-1 and the other nodes initialized at state-0 would result in the spread of state-1 through the graph, starting from node 3. The cluster density of the set of initially state-0 nodes is lower than in the previous case, with less interconnected nodes, which means that the probability of state-1 spreading to them is lower. (c) The contrast between the results in (a) and (b) is that in (a) the contagion spread throughout the graph is faster and reached more nodes than in (b) because the cluster density of initially state-0 nodes are high, while in (b) the contagion spread is slower and reached fewer nodes due to the low cluster density of initially state-0 nodes. In general, a high density of interconnected nodes will result in more efficient contagion spread.
|