Table 1 Capturing the Whole graph evolution algorithm

1. Define a time-window, Ʈ ⊂ T for analysis

2. (where Ʈ is the selected time-window

3. and T is the entire lifetime of the whole graph)

4. Define subgraph(s) of interest, S^’ ⊂ S

5. (where S^’ is the selected subgraph (s)

6.  and S is the entire space-dimension of the whole graph)

7. Define the temporal resolution \(t_{i}\) ⊂ Ʈ for iterative projections

8.    FOREACH \(t_{i}\) in Ʈ

9. Project Graph, \(PG_{{\left( {t_{i} } \right)}}\)

10. (where \(PG_{{\left( {t_{i} } \right)}}\) is a project graph at temporal resolution,\(t_{i}\))

11.    FOREACH Graph \(PG_{{\left( {t_{i} } \right)}}\)

12. Compute Graph Metrics, \(M_{i}\)

13. (where \(M_{i}\) is a graph metric (e.g. graph Density, Volume and Avg. path length)

14.    FOREACH Consecutive \(M_{i}\)

15. Compare \(M_{i}\) values, delta ∆

16. Identify patterns in ∆ values