[Update 1] Louvain-Performance and Self-Loops
For background, please see my earlier post. Recall that we sometimes want the presence of self-loops to be stronger than inter-community links. That is, despite the weight of some inter-community edge (e_1, e_2), the presence of heavy self-loops (e_1, e_1) and (e_2,…
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…
Input/Output Issue
The input file represents the network. It should be formatted as a space-delimited file, where each line contains the start node, destination node, and an optional edge weight. The test network. It is undirected and unweighted. The input file for…
Summer Research
This past summer I was a research assistant for the computer science department at Pomona College through the Summer Undergraduate Research Program (SURP). I worked with Professor Chen on a project involving community-detection algorithms for complex networks. I looked at…