Among the many methods used to detect communities in graphs, the modularity optimization algorithm of Newman is one of the most efficient and accurate to date [46]. This method uses modularity, a quantitative measure of the observed versus expected intra-community connections, as a means to guide assignments of nodes into communities. We applied the modularity optimization algorithm to the group connectivity matrices derived from the sliding boxcars described above.
