In the first lab exercise the following are implemented:
- Construction and visualization of complex types of networks
- Calculation of network metrics: a) clustering coefficient, b) Minimum path length c) Node eccentricity: diameter, radius, circumference, center
- Calculating node centrality metrics: degree centrality, closeness centrality, betweenness centrality, Katz centrality, and applying PageRank to a real network - web-Stanford
- The study of connectivity and robustness of networks
- The study of evolutionary network conversion
- The study of real networks - GoT
In the second lab exercise the following are implemented:
Node degree distribution and average degree of each topology. Node clustering factor distribution and the average clustering factor of each topology. Closeness centrality distribution and mean closeness centrality of each topology.
Using the SpectralClustering, girvan_newman and greedy_modularity_communities functions for each real and synthetic network:
- Visualize the communities resulting from each method
- Make the necessary comments (eg: comparison of the number of communities calculated by each algorithm).
In the third lab exercise the following are implemented:
- Graph construction and preprocessing for link prediction
- Introduction to similarity-based metrics for Link prediction
- Link prediction based on similarity-based metrics
- Link prediction with embedding based on random walks (Random Walks)
The Similarities dataset DBpedia is used.