Schema della sezione

  • Le3 - Thu Oct. 8, 2020 Networks as graphs; Directed and undirected networks; Examples; Weighted and signed graphs; The adjacency matrix: symmetries and conventions; Sparsity; Paths, Cycles, Distances and Diameter; Small world concept; Connectivity, Giant component, Bridges; Bipartite graphs.

    Le4 - Fri Oct. 9, 2020 Bipartite graphs; Projections; Centrality measures; Degree for undirected and directed networks; Average degree; Authorities and hubs; Degree distribution; Loglog plot; The power-law and scale-free networks; Preferential attachment and attractiveness.

    Le5 - Thu Oct. 15, 2020 PageRank centrality: the random walk rationale; Solution to dead ends and spider traps: the teleportation vector; PageRank versus degree centrality; Tuning the teleport vector: local PageRank; Examples of application; Closeness centrality.