NETWORK SCIENCE 2025-2026 - INP9087851
Résumé de section
-
-
Lecture hours (starting September 29, 2025)
Mon 8:30-10:00, room Ce
Fri 10:30-12:00, room CeIn classroom teaching
This year the course unit is delivered in classroom! For all the students waiting for a visa permit: contact me via email.Instructor
Tomaso Erseghe, tomaso.erseghe@unipd.itOffice hours
contact me during lectures, or send me an email for an appointmentTentative calendar 25/26
-
-
-
-
Les étudiants doiventMarquer comme terminé
Le1 - Mon Sep 29, 2025 Introduction to the course: elearning site, projects and interdisciplinary projects, network examples, contents overview, exam dates.
-
Les étudiants doiventMarquer comme terminé
Le2 - Fri Oct 3, 2025 Networks as graphs; Directed and undirected networks; Adjacency matrix; Nodes degrees and the degree distribution; Sparsity; Bipartite graphs; Projections on semantic graphs; Signed graphs.
-
-
-
Les étudiants doiventMarquer comme terminé
Le3 - Mon Oct 6, 2025 Layered networs; Paths, cycles, diameter, and small world networks; Connectedness and the condensation grapg; 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.
-
Les étudiants doiventMarquer comme terminé
Le4 - Fri Oct 10, 2025 Mathematics of the Barabasi-Albert model; 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.
-
Les étudiants doiventMarquer comme terminé
Le5 - Mon Oct 13, 2025 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; PageRank versus degree centrality; convergence properties of PageRank; PageRank matrix structure via the condensation graph.
-
Les étudiants doiventMarquer comme terminé
Le6 - Fri Oct 17, 2025 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: proof of the precision guarantee; Application to link prediction.
-
Les étudiants doiventMarquer comme terminé
Le7 - Wed Oct 20, 2025 Topic specific PageRank; Signed PageRank; Preventing spamming; Row-normalized PageRank; HITs centrality; Eigenvector and Katz centralities and their relation to PageRank and Degree centrality; Closeness and harmonic centrality; Betweenness centrality as a measure of brokerage.
-
Les étudiants doiventMarquer comme terminé
Le8 - Fri Oct 24, 2025 The clustering coefficient; Wrap-up on centrality measures; 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.
-
-
-
Les étudiants doiventMarquer comme terminé
Le9 - Mon Oct 27, 2025 Lab #1 network visualisation with Python by Lejla Dzanko
-
-