This project aims to use network analysis techniques on a moderate-sized network dataset. Ex: <year>,<volume>,<journal>, <author1>& ... &<authorN>, <title> You can find the bibliographic dataset at: http://snap.stanford.edu/na09/hep-th.txt. Basic function:
- Network degree distribution.
- Clustering co-efficiency.
- Shortest path length.
- Network centrality.
- Network connectivity.
- Node similarity.
Advanced function: Community discovery
- K-clique detection algorithm
- Modularity-based detection algorithm
- Description of the Girvan_newman detection algorithm
UI โ Visualization โ
Requirements: matplotlib: command: python -m pip install -U matplotlib networkx: command python -m pip install -U networkx