Derived from
|
20410571 FS520 – Complex networks in Computational Sciences LM-40 CAMISASCA GAIA
(syllabus)
NETWORKS AND GRAPHS - Graphs, trees and networks - Centrality measures, degrees and adjacent matrices - Grafi Random, model of Erdős and Rényi
SMALL WORLDS (SMALL WORLDS) - Definition of Little World - "Clustering" coefficient - Watts-Strogatz model
GENERALIZED RANDOM GRAPHS - Statistical characterization of networks - Distribution of the degree of networks of the real world (Real World) - Generalization of the Erdős – Rényi model - Random graphs with power law degree distributions
GROWING GRAPHS - Dynamic evolution of random graphs - Barabási – Albert model
CORRELATION BETWEEN DEGREES OF THE KNOTS - Correlations in a "Real World" network - Assortativity and de-assortment, "Rich Club" behavior
REASONS AND COMMUNITIES IN NETWORKS - Cycles in scale-free networks - Definition and research of communities in networks
"WEIGHED" NETS - Beyond purely topological networks: intensity of interactions in a system complex - Properties of the weighed nets
INTRODUCTION TO DYNAMIC PROCESSES: THEORY AND SIMULATION
(reference books)
Testi adottati: main test: V. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles, Methods and Applications" C.E. Cambridge University press (2017)
TEXT USED FOR SMALL PARTS OF THE PROGRAM "A. Barrat, M. Barthelemy, A. Vespignani "Dynamical processes on complex networks" Cambridge University Press (2008)
|