|Website:||website containing additional information|
|Period:||period 4 (week 17 through 26, i.e., 23-4-2018 through 29-6-2018; retake week 28)|
|Participants:||up till now 34 subscriptions|
|Schedule:||Official schedule representation can be found in Osiris|
Network science is an exciting new field that studies large and complex networks, such as social, biological, and computer networks. The class will address topics from network structure and growth to community detection and the spread of epidemics. We study the diverse algorithmic techniques and mathematical models that are used to analyze such large networks, and give an in-depth description of the theoretical results that underlie them.
List of potential topics
Basic algorithms for network science, lower bounds for polynomial-time problems, sampling algorithms, streaming algorithms, sublinear algorithms, power law algorithms, spreading phenomena, community detection, graph partitioning algorithms, phylogeny.
The course assumes that you have basic skills in algorithms and mathematics. In particular, the course assumes familiarity with basic graph algorithms (shortest paths, flows), such as offered in Algoritmiek, and NP-completeness, such as offered in Algoritmiek or Algorithms for Decision Support. Having taken Algorithms and Networks is helpful, but not required.
|Literature:||A. Barabasi, Network Science, for free online|
Other relevant books and papers will be added on the course web page.
|Course form:||The first part of the course will have two lectures a week and a tutorial. The second part of the course will be a seminar with student presentations.|
|Exam form:||Exam on studied chapters of the book, term paper, presentation. See the course webpage for details.|
|Minimum effort to qualify for 2nd chance exam:||You must have given a presentation and a response. See the course webpage for details.|