This graph shows how connected each network is within a system. Each node represents a network, and each edges represents a person overlapping them. The darker the edge color, the more people spanning across the two communities. This post explains the method in a bit more detail. This graph was made in R, with the […]
Assuming you start with a pajek file, you can use the following two functions to draw the graph and save it on to a PDF file. Then you call the function like this …and you get something like this
Small Network Vertices: 241 Edges: 447
Using this format Droid V6 Vertices: 118 Edges: 244 Slide V6 Vertices: 241 Edges: 447
This little R script calculates all three of Freeman’s Centrality measures, for individual nodes and entire graph. I didn’t write it…I got it from here.
Continues from here. I just found that the Python script in the previous post breaks when it encounters non-alphanumerical characters. That means I had to run a small code through Vim to delete them on both the usrIDs.txt and output.txt files. Once that was done then I had to change the usrIDs.txt file to add […]
The output file will create something like this