Table 2. Network modularity.
Communities | Modularity | Towns in modules | Cramer’s V | ||||||
---|---|---|---|---|---|---|---|---|---|
Min | Max | Mean | w ij (2)–1 | w ij (2)–2 | w ij (2)–3 | w ij (2)–4 | |||
w ij (1) | 5 | 0.209 | 254 | 720 | 511.6 | ||||
w ij (2)–1 | 14 | 0.373 | 72 | 285 | 182.7 | 1 | |||
w ij (2)–2 | 15 | 0.372 | 72 | 285 | 170.5 | 0.983 | 1 | ||
w ij (2)–3 | 13 | 0.372 | 106 | 285 | 196.7 | 0.968 | 0.982 | 1 | |
w ij (2)–4 | 14 | 0.371 | 72 | 285 | 182.7 | 0.954 | 0.965 | 0.953 | 1 |
w ij (2)–5 | 15 | 0.372 | 72 | 270 | 170.5 | 0.984 | 0.960 | 0.981 | 0.963 |
Few large communities are identified in the network compared to the network. The five runs of the Louvain method finds exactly the same community structure in the network, therefore we report the result of only one run. The community finding algorithm produced distinct community structures in the network; therefore we report all five runs (the number after the hyphen denotes the sequence of the run). The pair-wise Cramer’s V index in network is always above 0.95.