Résumé de section

    • Le1 - Mon Sep 29, 2025 Introduction to the course: elearning site, projects and interdisciplinary projects, network examples, contents overview, exam dates.

    • 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.

    • 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.

    • 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.

    • 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.

    • 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.

    • 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.

    • 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.

    • Le9 - Mon Oct 27, 2025 Lab #1 network visualisation with Python by Lejla Dzanko

    • Le10 - Fri Oct 31, 2025 Lab #2 network visualisation with Gephi by Lejla Dzanko

    • Le11 - Mon Nov 3, 2025 Lab #3 scraping data from Reddit and TikTok by Lejla Dzanko

    • Le12 - Fri Nov 7, 2025 Lab #4 text cleaning, buiding a semantic network, sentiment-like analysis

    • Le13 - Mon Nov 10, 2025 Project ideas presentations by Federico Mason and Lejla Dzanko

    • Le14 - Fri Nov 14, 2025  Homophily and related concepts: Selective exposure, Polarization, Ego Chamber, Filter bubble; Degree homophily or assortativity; the correlation matrix; Nearest neighbour degree function and its exponent; Structural disassortativity; Structural and natural cutoffs; Random rewiring; Network robustness; Robustness of scale-free networks; Attack tolerance; Robustness optimization; An application example; Community detection problem: Granovetter's view and the role of weak ties; The core-periphery model and overlapping communities.

    • Le15 - Mon Nov 17, 2025 Interdisciplinary projects presentations by SNA students

      8:30 Intro,
      8:35 Film communities, 
      8:45 Framing AI-generated celebrity deepfakes, 
      8:55 Jeff Bezos wedding and the display of wealth and luxury, 
      9:05 K-pop soft power,
      9:15 Polarization effects in the disinformation on immigration,
      9:25 Enthusiasm and skepticism towards AI,
      9:35 Charlie Kirk's assassination,
      9:45 Discussion and group forming,
      10:00 End.

    • Le16 - Fri Nov 21, 2025 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.

    • Le17 - Mon Nov 24, 2025 Modularity with overlap: extending the Louvain approach; 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.

    • Le18 - Fri Nov 28, 2025 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, algorithm and performance.

    • Le19 - Mon Dec 1, 2025 Stochastic block models: Degree corrected SBMs; Mixed membership SBMs; Weighted SBMs; Dendrograms: divisive and agglomerative approaches; Girvan-Newmann method; HDBSCAN.

    • Le20 - Fri Dec 5, 2025 Clique percolation; Wrap-up on community detection; Semantic networks: The non-negative matrix factorization approach; generalized Kullback-Leibler divergence metric; Latent Dirichlet allocation: statistical model; performance.

    • Le21 - Fri Dec 12, 2025 Variational auto-encoders and the ELBO function; VAE for topic detection: NVDM, ProdLDA, DirVAE, NFTM, and NBVAE models.

    • Le22 - Mon Dec 15, 2025 NMF VAE-like model; The transformer architecture: BERT, BERTA, GPT-2, and GPT-3 models; BERTopic model and its performance; Wrap-up on topic detection.

    • Le23 - Fri Dec 19, 2025 Lab 5 - topic detection

    • Le24 - Mon Dec 22, 2025 - Feedback to interdisciplinary/non interd. projects.