Graphs and epidemiology

Contact:
Serge Richard (richard@math.nagoya-u.ac.jp), Rm. 247 in Sci. Bldg. A

• Description : the pdf file

• Schedule : Wednesday 8.45 - 10.15 in room 309 of the math building and on Zoom
  

• Class dates :
  April 14, 21, 28
  May 12, 19, 26
  June 2, 9, 16, 23, 30
  July 7, 14, 21
  

• Lecture notes : The cumulative notes

• Content :
  1) Basic definitions
  2) Random graphs (additional information available in Chapters 10 and 11 of these lecture notes)
  3) Ergodic systems on graphs: top-down
  4) Bottom-up approach, closure
  5) Mean-field (Appendix on one application of SEIR model)
  6) SIR and percolation
  7) Dynamic networks
  8) Miscellaneous
  

• Student reports :
  Upper bound for SIS system, by Ralph Gorbach
  Block diagonal systems of equations (I), by Takeshi Shinohara
  About the clustering coefficient, by Ralph Gorbach
  Block diagonal systems of equations (II), by Takeshi Shinohara
  An example of lumping, by Takamasa Yoshida
  Transition diagrams and differential systems, by Ishiguro Yoshihiro
  Additional examples of lumping, by Takamasa Yoshida
  

• References : (electronic version available upon request)
  [GYA] J.L. Gross, J. Yellen, M. Anderson, Graph theory and its applications, CRC press, 2019.
  [Ne] M. Newman, Networks, second edition, Oxford University Press, 2018.
  [KMS] I. Kiss, J. Miller, P. Simon, Mathematics of epidemics on networks, Springer, 2017.