C5.4 Networks, University of Oxford

In this repository, we display the report, and code submitted for the assessment of the C5.4 Networks module. Task was to take the theory of network science and apply it to hypergraphs. In my report, I look at node centrality measures using random walks on hypergraphs, and ultimately construct a biased random-walk centrality measure in a similar fashion to PageRank.

Contents

• Report: here
• Eigenvalue Centrality: here
• Main Example: here
• Erdos Renyi Example: here

Extra, ommited from the report

• Real Data/American Revolution Example: here
• Preferential Attachment Model (needs work, nx function is too slow): here