Section outline

    • Students must
      Mark as done

      Le20 - Tue Dec. 13, 2022 Concluding remarks on BERT topic; The idea of network robustness; Percolation theory results; Robustness of scale-free networks; Proof of the Molloy Reed criterion; Breaking points in scale-free networks; The inhomogeneity ratio; Attack tolerance and fragility of scale-free networks; Mathematical analysis; Optimising robustness; An application example.

    • NS20 Network robustness File
      Students must
      Mark as done
      Uploaded 30/08/22, 16:26
    • Students must
      Mark as done

      Le21 - Mon Dec. 19, 2022 The link prediction task; Neighbour based techniques: common neighbours, Adamic Adar, and resource allocation. Path based and random-walk based techniques for link prediction; Performance comparison in terms of AUC and precision; Adding a learning technique in supervised random walk; Extensions to bipartite graphs.

    • NS21 Link prediction File
      Students must
      Mark as done
      Uploaded 30/08/22, 16:26
    • Students must
      Mark as done

      Le22 - Tue Dec. 20, 2022 Extensions to bipartite graphs; Projecting socio-psychological markers from tweets to words.

    • NS22 Projections File
      Students must
      Mark as done
    • asonam2022 File
      Students must
      Mark as done
    • Students must
      Mark as done

      Le23 - Mon Jan 10, 2022 Language and social cognition by prof C. Suitner.

    • NS23 Language and social cognition File
      Students must
      Mark as done
    • Students must
      Mark as done

      Le24 - Tue Jan 11, 2022 (tentative) Projects discussion.