Metrics and Definitions

Initial definitions	Given a dynamic network, we call the vertex set V, with |V | = N. Edges exist between vertices at any of timepoints 1, 2 …, T. May be represented as a sequence of N × N adjacency matrices A(1), A(2), …, A(T ).
Contact	An edge between two vertices at a specified time.
Contact sequence	A list of contacts within the dynamic network specified as tuples (i, j, t) for contacts between nodes i, j at time t.
Time-aggregated graph	Summary static graph of dynamic network with edges existing between nodes i, j if i and j connect at any timepoint within the dynamic network.
Time-respecting path	A sequence of contacts (n0, n1, t0), (n1, n2, t1) … (nk−1, nk, tk−1) with ti < ti+1 for i = 0, …, k − 2.
Source set	The set of vertices that can reach a given node via time-respecting paths terminating no later than some time t.
Set of influence	The set of vertices which can be reached from a given node through time-respecting paths starting no earlier than some time t.
Temporal path length	The difference in time between the last and first contact of a time-respecting path [63].
Latency	The temporal path length of the fastest path between two nodes. Also known as temporal distance [63].
Forward Latency	Denoted τ(i, j, t), the time needed to reach node j from i along time-respecting paths beginning no earlier than t [63].
Betweenness centrality	For node i and timepoint t, $$C_B(i,t)=\sum _{i\ne j\ne k}\frac{{\sigma }_{j,k}(i,t)}{{\sigma }_{j,k}(t)}$$ with σj,k the number of shortest paths between nodes j, k beginning no earlier than t, and σj, kt, i the number of such paths that pass through node i [66].
Closeness centrality	For node i and time t, $$C_C(i,t)=\frac{1}{N-1}\sum _{j\ne i}\frac{1}{\tau (i,j,t)}$$ [63].
Broadcast centrality	Given node i, the broadcast centrality is $$b(i):=\sum _{j=1}^N{Q}_{i,j}$$ where Qi,j is the normalized ability of node i to communicate with node j (See Eq. 7) [35].
Receive centrality	Given node j, receive centrality is defined $$r(j):=\sum _{i=1}^N{Q}_{i,j}$$ [35].
Temporal correlation coefficient	Let Ai,j (t) be the connectivity of nodes i, j at time T. Then for node i, $$C_i=\frac{1}{T-1}\sum _{t=1}^{T-1}\frac{{\sum }_j{A}_{i,j}(t)A_{i,j}(t+1)}{\sqrt{[{\sum }_j{A}_{i,j}(t)][{\sum }_j{A}_{i,j}(t+1)]}}$$ [76].
Characteristic temporal path length	For a dynamic network, $$L=\frac{1}{N-1}\sum _{i,j}d(i,j)$$ letting d(i, j) be the temporal distance between nodes i, j.
Temporal small worldness	Let C, Crand be the average temporal correlation coefficient and L, Lrand the temporal characteristic path length for the dynamic network and randomized model, respectively. Then the temporal small worldness is $$\frac{C/C_{\mathit{rand}}}{L/L_{\mathit{rand}}}$$ [76].
Flexibility	For node i, the flexibility is $$f_i=\frac{m}{T-1}$$ where m is the number of times node i change communities [58].
Promiscuity	The promiscuity of node i is $${\psi }_i=\frac{k}{K}$$ with k the number of communities of which node i is a member and K the total number of communities in the dynamic network [91].
Cohesiveness	The number of times a node changes communities mutually with another node [92].