Activity-driven model

---

Network science
Theory
Graph Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis Optimization Reciprocity Closure Homophily Transitivity Preferential attachment Balance theory Network effect Social influence
Network types
Informational (computing) Telecommunication Transport Social Scientific collaboration Biological Artificial neural Interdependent Semantic Spatial Dependency Flow on-Chip
Graphs
Features Clique Component Cut Cycle Data structure Edge Loop Neighborhood Path Vertex Adjacency list / matrix Incidence list / matrix Types Bipartite Complete Directed Hyper Multi Random Weighted
Metrics Algorithms
Centrality Degree Motif Clustering Degree distribution Assortativity Distance Modularity Efficiency
Models
Topology Random graph Erdős–Rényi Barabási–Albert Fitness model Watts–Strogatz Exponential random (ERGM) Random geometric (RGG) Hyperbolic (HGN) Hierarchical Stochastic block Maximum entropy Soft configuration LFR Benchmark Dynamics Boolean network agent based Epidemic/SIR
Lists Categories
Topics Software Network scientists Category:Network theory Category:Graph theory

In Network Science, the activity-driven model is a temporal network model in which each node has a randomly-assigned "activity potential" , which governs how it links to other nodes over time.

Each node $j$ (out of $N$ total) has its activity potential $x_i$ drawn from a given distribution $F(x)$. A sequence of timesteps unfolds, and in each timestep each node $j$ forms ties to $m$ random other nodes at rate $a_i=\eta x_i$ (more precisely, it does so with probability $a_i\mathrm{\Delta }t$ per timestep). All links are then deleted after each timestep.

Properties of time-aggregated network snapshots are able to be studied in terms of $F(x)$. For example, since each node $j$ after $T$ timesteps will have on average $m\eta x_{i}T$ outgoing links, the degree distribution after $T$ timesteps in the time-aggregated network will be related to the activity-potential distribution by

$P_T(k)\propto F\left(\frac{k}{m\eta T}\right).$

Spreading behavior according to the SIS epidemic model was investigated on activity-driven networks, and the following condition was derived for large-scale outbreaks to be possible:

$\frac{\beta }{\lambda }>\frac{2⟨a⟩}{⟨a⟩+\sqrt{⟨a^2⟩}},$

where $\beta$ is the per-contact transmission probability, $\lambda$ is the per-timestep recovery probability, and ($⟨a⟩$, $⟨a^2⟩$) are the first and second moments of the random activity-rate $a_j$.

Extensions

A variety of extensions to the activity-driven model have been studied. One example is activity-driven networks with attractiveness, in which the links that a given node forms do not attach to other nodes at random, but rather with a probability proportional to a variable encoding nodewise attractiveness. Another example is activity-driven networks with memory, in which activity-levels change according to a self-excitation mechanism.

References

This article "Activity-driven model" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Activity-driven model. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.

📰 Article(s) of the same category(ies)

• 1999–2000 Polish League Cup
• Joan Hierholzer
• Samah Wani
• Andrew M. Stroth
• Rajabli, Ali Muhammad oglu
• List of species made extinct by human activities
• Bandidos gault

---