Skip to content

Report, code and figures submitted for assessment for the C5.4 Networks module at the University of Oxford

Notifications You must be signed in to change notification settings

thomasarmstrong98/hypergraph_project

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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

About

Report, code and figures submitted for assessment for the C5.4 Networks module at the University of Oxford

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published