Without much explanation, this is something which will help me work on a new layout algorithm to display my network graphs… This is how you initiate the process of drawing the nodes and the edges, all I need to do next is figure out a way of calculating the coordinates for each based on a […]

# Tag: social network analysis

## Links Between Networks – Python

I have 43 networks where some of the actors overlap, and what I would like to do is to visualise this overlap. The problem is that these networks combined will have more that 40,000 nodes, so it will be very messy to stick everything into one network graph. So the next best thing is to […]

## Mathematical Combination – Python

The idea is to print all the different combinations from a series of numbers in a list (order not important). This script will be used to automate the comparison of 40+ networks on a list :D So, if we start with a series of 1 to 5, what we want to get is So here […]

You start with a pajek file, called something_pajek.net, then you run this code. You should end up with something like this.

## Draw and Save Network to PDF – R

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

This Python code will read a Pajek graph and calculate its degree centrality using this formula … To test the result I will be using example 17 from Freeman’s (1978) Centrality in Social Networks: Conceptual Clarification. Freeman’s calculation for this example is 0.42. The graph is written in a file named graph17.net, which reads: This […]

Calculating Freeman’s degree centrality for each node… …and for the graph. All the information is contained in an external file graph.csv, which contains this Where the “freq” column is the number of edges adjacent to the node. To find node centrality This script outputs the file data_graph.csv with the following information: Where CD is the […]

## iGraph Graph Layouts Graph – R

Small Network Vertices: 241 Edges: 447

## Some Social Networks – R

Using this format Droid V6 Vertices: 118 Edges: 244 Slide V6 Vertices: 241 Edges: 447

For OS X – Mountain Lion Save yourself a freaking headache Install Brew. Install the iGraph C library Install pip Python package manager Now for the iGraph Python library

You must be logged in to post a comment.