[Update 1] Louvain-Performance: Weights of Nonexistent Edges
Earlier, I wrote a post on how performance on weighted graphs uses a meaningful maximum M to account for the weights of nonexistent edges. At that time, my challenges were (1) figuring out how to calculateĀ M, and (2) changing my…
![Creating the Adjacency Matrix](https://research.pomona.edu/complexnetworks/files/2015/12/matrixStructures-150x150.png)
Creating the Adjacency Matrix
We are now able to construct an adjacency matrix of the network. As Anastasia explained in a previous post, we will use the adjacency matrix in silhouette index to find the shortest path between all pairs of vertices. Our matrix…