Skip to main content
. 2015 Oct 23;10(10):e0141191. doi: 10.1371/journal.pone.0141191

Fig 1. Approach based on transition matrices.

Fig 1

a) A fictitious 5 x 5 transition matrix, b) The corresponding undirected network with nodes S1, S2, S3, S4, S5 and links (i.e. transitions) between these nodes, c) The corresponding weighted undirected network with the number of links between pairs of nodes on the left, and weighted adjacency matrix M on the right d) Degree centrality for each node in the network.