Graphs and Network Analysis

Course ID
CSIS1-6
Direction
2nd
Semester
Spring
Type
2nd direction mandatory

Learning Outcomes

Students will acquire a comprehensive understanding of fundamental graph theory concepts, network metrics, and advanced algorithms applied to real-world scenarios. By delving into topics such as degree centrality, eigenvector centrality, and community detection, students will develop a robust skill set in graph analysis and visualization. The course not only equips students with the ability to represent complex systems as graphs but also enables them to utilize cutting-edge tools and methodologies for problem-solving. Furthermore, the exploration of applications, including social networks and pharmacology, ensures that students gain practical insights into diverse fields. Upon completion, graduates will possess a refined capacity to analyze, model, and interpret intricate relationships within networks, fostering their competence in research, industry, and various interdisciplinary domains. The profound impact of this course is expected to extend beyond academic realms, empowering students with a skill set highly sought after in today's data-driven and interconnected world.

Course Content

  1. Introduction to graphs. Basic definitions. Paths, cycles, shortest paths.
    Representation of graphs and toolbox of problems/algorithms on graphs.
    Overview of basic concepts of graph theory. Introduction to network analysis metrics.
    Degree centrality, eigenvector centrality, Katz centrality. Pagerank and HITS. Co-citation and bibliographic coupling networks. Closeness centrality, Betweenness centrality.
    Node groups. Transitivity. Reciprocity. Signed graphs. Node similarity. Homophily.
    The Internet as a graph. Properties of networks in the real world. Gnp and Gnm models. Smallworld model. Power-law and scale-free networks. Barabasi-Albert model. R-MAT model.
    Study of degree distributions in real graphs. Finding power-law exponents in power-law distributions. Generating graphs with realistic characteristics.
    Link prediction in graphs.
    Community detection in graphs.
    Shallow methods for knowledge representation vector generation (graph embeddings).
    Message-passing methods.
    Graph Neural Networks.
    Applications (social networks, pharmacology, and others).

General Skills

Search, analysis and synthesis of data and information with the use of the assorted technologies

Decision Making

Independent work

Team work

Promoting free, creative and deductive reasoning

Learning and Teaching Methods - Evaluation

Teaching methods: On site 

Use of Information and Communication Technologies: eclass

Activity Work load
Semester
Lectures 26
Lab exercises 30
Thesis 34
Independent Study 60
Total 150

Assessment

Ι. Written exam 60% which includes:
- Multiple choice questions
- Solving problems using Python
- Comparative evaluation
ΙΙ. Exercises 40%

Literature

– Επιστήμη Δικτύων, Κωδικός Βιβλίου στον Εύδοξο: 112701994, Έκδοση: 1/2022, Συγγραφείς: Albert Laszlo Barabasi, ISBN: 9789605781002, Τύπος: Σύγγραμμα, Διαθέτης (Εκδότης): ΕΚΔΟΣΕΙΣ ΝΕΩΝ ΤΕΧΝΟΛΟΓΙΩΝ ΙΔΙΩΤΙΚΗ ΚΕΦΑΛΑΙΟΥΧΙΚΗ ΕΤΑΙΡΕΙΑ, Complete preprint on-line at http://networksciencebook.com/
– Networks: An introduction. Mark Newman. Oxford University Press, 2010.
– Θεωρία και Αλγόριθμοι Γράφων, Κωδικός Βιβλίου στον Εύδοξο: 33134148, Έκδοση: 1η/2013, Συγγραφείς: Ιωάννης Μανωλόπουλος, Απόστολος Παπαδόπουλος, Κωνσταντίνος Τσίχλας, ISBN: 9789606759871, Τύπος: Σύγγραμμα, Διαθέτης (Εκδότης): ΕΚΔΟΣΕΙΣ ΝΕΩΝ ΤΕΧΝΟΛΟΓΙΩΝ, ΙΔΙΩΤΙΚΗ ΚΕΦΑΛΑΙΟΥΧΙΚΗ ΕΤΑΙΡΕΙΑ
– Graph Representation Learning. William L. Hamilton. Morgan  Claypool. https://www.cs.mcgill.ca/~wlh/grl_book/ 

 

Journal of Graph Algorithms and Applications. http://jgaa.info ISSN: 1526-1719