• introduction • models of networks (including Erdos-Renyi, PA and configuration model) • dynamics on networks I: random walks • centrality measures • assortativity and homophily • community detection • stochastic Block Models • dynamics on networks II: epidemic Spreading
After about 15 hours of lectures, students will work on a project on mathematical and/or computational aspects of network science.
In groups of two or three, students will be asked to submit a project in which they reproduce and critically present the results of one or more research articles. The projects will be presented during the examination period.
A syllabus will be made available to students.