|
Derived from
|
20410571 FS520 – Complex networks in Computational Sciences LM-40 CAMISASCA GAIA
(syllabus)
NETWORKS AND GRAPHS
- Graphs, trees and networks
- Centrality measures and degree
- Random graphs, the Erdős and Rényi model
SMALL WORLDS NETWORKS
- Definition of Small World
- Clustering Coefficient
- The Watts-Strogatz model
GENERALISED RANDOM GRAPHS
- Statistical description of networks
- Degree Distributions of real networks
- Generalization of the Erdős–Rényi model
- Radom graphs with power-law degree distributions
GROWING GRAPHS
- Dynamical evolution of random graphs
- The Barabási–Albert model
DEGREE CORRELATIONS
- Correlated networks
- Assortative and Disassortative Networks, "Rich Club" behavior
WEIGHTED NETWORKS
- Beyond purely topological networks: tuning the interactions in a complex system
- The Barrat-Barthélemy-Vespignani model
INTRODUCTION TO DYNAMICAL PROCESSES: THEORY AND SIMULATION
(reference books)
TESTO PRINCIPALE DEL CORSO:
V. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles, Methods and Applications", Cambridge University press (2017)
TESTO UTILIZZATO PER PICCOLE PARTI DI PROGRAMMA:
A. Barrat, M. Barthelemy, A. Vespignani, "Dynamical processes on complex networks", Cambridge University Press (2008)
Main text-book:
|
Università Roma Tre