Practice sessions
Subjects covered
(order may change)
- Introduction, graphs
- Basic measures, Random graphs (Erdős-Rényi, Watts-Strogatz)
- Scale free property, Barabási-Alber model
- Percolation, robustness
- Centrality, navigation
- Social networks, node similarity
- Random walk, temporal networks
- SIR, spreading
- Sampling
- Stochastic block model, Embedded networks
- Communities
- Hierarchy, Core periphery structure
Requirements
- 70% of Homeworks
- Exam (written)
- Project presentations (in pairs)
Evaluation
- Exam: 100, those who fail the test cannot get a grade
- Projects: 100 points for both pairs
- Marks (all points summed up):
- -109
- 110-139
- 140-169
- 170-199
- 200-
Consultation
During the classes or on demand by email.
- Teacher: János Török