Empirical analysis of networks

Network representations, data structures, fundamental algorithms, programming libraries and software. Node layout and network visualization.

Lectures materials:

• Network representations and data structures (slides)
  
• Fundamental network analysis algorithms (slides)
• Node layout and network visualization (slides)
• Network libraries and software (handout)
  

Book chapters:

• Ch. 4.8: Generating networks etc. in Barabási, A.-L., Network Science (Cambridge University Press, 2016).
  
• Ch. 9-11.1: Network algorithms etc. in Newman, M.E.J., Networks: An Introduction (Oxford University Press, 2010).

Course readings:

• Brandes, U., A faster algorithm for betweenness centrality, J. Math. Sociol. 25(2), 163-177 (2001).
• Batagelj, V. & Brandes, U., Efficient generation of large random networks, Phys. Rev. E 71(3), 036113 (2005).
  
• Sanders, P. & Schulz, C., Scalable generation of scale-free graphs, e-print arXiv:1602.07106v1, pp. 6 (2016).
• Clauset, A., Shalizi, C.R. & Newman, M.E.J., Power-law distributions in empirical data, SIAM Rev. 51, 661-703 (2009).
• Hočevar, T. & Demšar, J., A combinatorial approach to graphlet counting, Bioinformatics 30(4), 559-565 (2014).
• Ahmed, N.K., Neville, J. et al., Graphlet decomposition, e-print arXiv:1506.04322v2, pp. 32 (2016).
• Fortunato, S., Community detection in graphs, Phys. Rep. 486(3-5), 75-174 (2010).
• Berkhin, P., A survey on PageRank computing, Internet Math. 2(1), 73-120 (2005).

• Eades, P., A heuristic for graph drawing, Congressus Numerantium 42, 146-160 (1984).
  
• Kamada, T. & Kawai, S., An algorithm for drawing general undirected graphs, Inform. Process. Lett. 31(1), 7-15 (1989).
  
• Fruchterman, T.M.J. & Reingold, E.M., Graph drawing by force-directed placement, Softw: Pract. Exper. 21(11), 1129-1164 (1991).
  
• Rodrigues, J., Tong, H. et al., GMine, In: Proceedings of VLDB ’06 (Seoul, South Korea, 2006), pp. 1195-1198.
• Rodrigues, J., Traina, A. et al., Supergraph visualization, In: Proceedings of ISM ’06 (San Diego, CA, USA, 2006), pp. 227-234.
• Kobourov, S.G., Spring embedders and force directed graph drawing algorithms, e-print arXiv:1201.3011v1, pp. 23 (2012).
  
• Gibson, H., Faith, J. & Vickers, P., A survey of two-dimensional graph layout techniques, Infor. Visual. 12(3-4), 324-357 (2013).
  
• Ma, K.-L. & Muelder, C.W., Large-scale graph visualization and analytics, Computer 46(7), 39-46 (2013).