Overview of common dynamic network models
The following is a recording on this topic, I hope you find it useful!
Feel free to watch at 1.5x or 2x speed.
Note: If you find something missing or incorrect in the recording, then please let me know!
activated based on the influence of neighbors
active is a binary attribute of the nodes (e.g. sick or not sick)Source: Menczer1
Initial configuration: Begin with either a real-world contact network, reconstructed from empirical data, or an artificial network constructed from a generative network model
Source: Menczer1
Initial configuration: Begin with either a real-world contact network, reconstructed from empirical data, or an artificial network constructed from a generative network model
In the fractional threshold model, the activation condition is \[ \frac{n_i^{\text {on }}}{k_i} \geq \theta_i, \]
If all nodes have equal threshold \(\theta\), the condition is that an inactive node needs to have at least a fraction \(\theta\) of active neighbors to be activated.
Source: Menczer1
Source: Menczer1
Opinion: A view formed about something, not necessarily based on factOpinion dynamics: Processes that determine how opinions diffuse in societyOpinion models are usually divided into two categories
Discrete opinions (integer values) -When there are a limited discrete number of positions on a specific issue
Continuous opinions (real-valued)
consensus: all nodes having the same opinion,polarization: some nodes holding an opinion and the rest holding the otherStructure-dynamic relationThe model dynamics usually follow these steps:
A few standard variables can be computed and monitored in these models:
Average opinion: The arithmetic average of the opinions across the nodes.
Exit probability: Probability that the network is to reach consensus to opinion one, as a function of the fraction of nodes with opinion one in the initial configuration.
Structure-dynamic relation
assortativity is found in many real graphs, particularly social networks
Coevolution models:
In the bounded-confidence model, at iteration \(t\), each node \(i\) has opinion \(o_i(t)\), which is a real number between, say, zero and one. An iteration consists of a sweep over all nodes, synchronously or in random order. At iteration \(t+1\), when it comes to node \(i\), we pick one of its neighbors at random, say \(j\). If \[ \left|o_i(t)-o_j(t)\right|<\epsilon, \] where \(\epsilon\) is the confidence bound, the values of the opinions are updated to \[ \begin{aligned} & o_i(t+1)=o_i(t)+\mu\left[o_j(t)-o_i(t)\right], \\ & o_j(t+1)=o_j(t)+\mu\left[o_i(t)-o_j(t)\right], \end{aligned} \] where \(\mu>0\) is the convergence parameter. If \(\mu=1 / 2\), the opinions converge to their average, meaning that both individuals adopt a common intermediate position. If \(\mu=1\) the opinions switch, in that \(i\) adopts \(j\) ’s opinion and vice versa. Usually \(\mu\) varies in the range \((0,1 / 2]\).
Social diffusion mechanisms