Corso: NETWORK SCIENCE 2024-2025 - INP9087851

Indice degli argomenti

INP9087851 - NETWORK SCIENCE 2024-2025

Minimizza tutto Espandi tutto
- Lecture hours (starting October 2, 2024)
  Wed 8:30-10:00, room De
  Fri 16:30-18:00, room Ce
  
  In classroom teaching
  This year the course unit is delivered in classroom! For all the students waiting for a visa permit, we will organise a meeting to share info: contact me via email.
  
  Instructor
  Tomaso Erseghe, tomaso.erseghe@unipd.it
  
  Office hours
  contact me during lectures, or send me an email for an appointment
  Tentative calendar 24/25
- News about the course Forum
- Institutional page (contains syllabus and useful info on the course) URL
Course slides & material
Introduction
- Le1 - Wed Oct 2, 2024 Introduction to the course: elearning site, projects and interdisciplinary projects, network examples, contents overview, exam dates.
- Le2 - Fri Oct 4, 2024 Networks as graphs; Directed and undirected networks; Paths, Cycles, Diameter; Adjacency matrix; Nodes degrees and the degree distribution; Sparsity; Bipartite graphs; Signed graphs; Connectivity.
Centrality
- Le3 - Wed Oct 9, 2024 Degree centrality; Power law versus Poisson distribution; Estimation methods for the degree exponent: ML approach; Explaining the power law; Erdos-Renyi random model: binomial and Poisson descriptions of the model; Small world; Power law versus Poisson distribution; Growth and preferential attachment; the Barabasi-Albert model.
- Le4 - Fri Oct 11, 2024 Attractiveness and the Bianconi-Barabasi model; Analysis of the Bianconi-Barabasi model; Examples with equal and uniform fitness; Measuring fitness: the www; Other ideas for modelling the power-law, Properties of the power-law: largest hub, moments and scale-free networks, distances; PageRank: random walk, dead ends and spider traps, teleportation; PageRank with restart.
- Le5 - Wed Oct. 16, 2024 PageRank versus degree centrality; convergence properties of PageRank; PageRank matrix structure via the condensation graph; Action of the teleport vector: one leaf-only, one eigenvalue set to 1 and the rest to (at most) c; Interpretation; Tuning the teleport vector: Local PageRank; Examples of application; Approximate PageRank and the push operation.
- Le6 - Fri Oct. 18, 2024 Approximate PageRank and the push operation: proof of the precision guarantee; Application to link prediction; Topic specific PageRank; Signed PageRank; Preventing spamming; Row-normalized PageRank; HITs centrality.
- Le7 - Wed Oct 23, 2024 Eigenvector and Katz centralities and their relation to PageRank and Degree centrality; Closeness and harmonic centrality; Betweenness centrality as a measure of brokerage; The clustering coefficient; Wrap-up on centrality measures.
Community detection

Evidenziato
- Le7 - Wed Oct 23, 2024 Community detection problem: Granovetter's view and the role of weak ties; The core-periphery model and overlapping communities; Modularity: definition.
- Le8 - Fri Oct 25, 2024 Modularity: definition and matrix formalization; The Louvain algorithm for modularity optimization and its main characteristics; Solving greediness by consensus clustering; Generalizing modularity: the directed and signed network case; Modularity with overlapping communities.
- Le9 - Wed Oct 30, 2024 Interdisciplinary projects overview and deadlines; Modularity in the two-communities case: spectral approach; The normalised cut criterion; Suboptimal solution to normalised cut: algebraic connectivity and Fiedler's eigenvector; Conductance and the network community profile; InfoMap criterion: node and community view.
- Le10 - Wed Nov 6, 2024 The socio-psychological perspective on networks, by prof. Caterina Suitner.
- Language and social cognition - the socio-psychological view on networks File
- Le11 - Wed Nov 13, 2024 Projects overview and deadlines; The InfoMap criterion: the node view, the community view, inside communities; Compact result; Normalized mutual information; Wrap-up on community assignment measures; The BigClam: rationale of a model-based approach and algorithm.
- Le12 - Fri Nov 15, 2024 The BigClam: algorithm and performance; Stochastic block models: Degree corrected SBMs; Mixed membership SBMs; Weighted SBMs; Dendrograms: divisive and agglomerative approaches; Girvan-Newmann method; HDBSCAN.
- Le13 - Wed Nov 20, 2024 Clique percolation; Wrap-up on community detection; Correlation networks.
Network layout
- Le13 - Wed Nov 20, 2024 The layout problem; Aesthetic criteria; Spring-embedder algorithm; Repulsive and attractive forces; Fruchterman & Reingold; Force atlas 2; Gravity; Approximate repulsion; UMAP as a force-layout algorithm; Software tools.
Projects and IPs presentations
- Le14 - Fri Nov 22, 2024 Presentation of interdisciplinary projects (tentative)
  
  16:30 Intro,
  
  16:35 Overtourism,
  
  16:45 Climate change,
  
  16:55 Privacy,
  
  17:05 Trad wives,
  
  17:15 Abortion,
  
  17:25 Veganism,
  
  17:35 Discussion and group forming,
  
  18:00 End
- IP day presentations (will be loaded here, but in the meanwhile you can find the on-working versions) URL
Python and Gephi labs
Semantic networks
Conclusion
Video resources from past years (may be helpful)

Indice degli argomenti

INP9087851 - NETWORK SCIENCE 2024-2025

Course slides & material

Introduction

Centrality

Community detection

Network layout

Projects and IPs presentations

Python and Gephi labs

Semantic networks

Conclusion

Video resources from past years (may be helpful)