Community Detection
Contact Graph:
In a contact graph, the nodes are the physical nodes from the traces, the edges are the contacts, and the weights of the edges are the values based on the metrics specified such as the number of contacts during the experiment.
K-CLIQUE Community Detection:
Palla et al. define a k-clique community as a union of all k-cliques (complete subgraphs of size k) that can be reached from each other through a series of adjacent k-cliques, where two k-cliques are said to be adjacent if they share k-1 nodes.
As k is increased, the k-clique communities shrink, but on the other hand become more cohesive since their member nodes have to be part of at least one k-clique.
Weighted Network Analysis(WNA):
It is an extension of the unweighted modularity. For weighted Networks, see “Weighted Network in Wikipedia”.
Heterogeneity in Centrality:
The centrality measure in traditional weighted networks may not work since the edges are not necessarily concurrent in time evolving networks.
