2020 Fall COMPSCI 294 179 LEC 179

2020 Fall

COMPSCI 294 179 - LEC 179

Special Topics

Network Structure and Epidemics

Christian Borgs

Aug 26, 2020 - Dec 11, 2020
Tu, Th
02:30 pm - 03:59 pm
Internet/Online
Class #:34176
Units: 3

Instruction Mode: Remote Instruction

Current Enrollment

Total Open Seats: 0
Enrolled:
Waitlisted:
Capacity:
Waitlist Max:
No Reserved Seats

Hours & Workload

2 to 11 hours of outside work hours per week, and 1 to 3 hours of instructor presentation of course materials per week.

Course Catalog Description

Topics will vary from semester to semester. See Computer Science Division announcements.

Class Description

Networks play a central role in our social and economic lives. They affect our well-being by influencing the information we receive, products we choose to buy, economic opportunities we enjoy, and diseases we catch from others. How do these networks form? Which network structures are likely to emerge in society? And how does the structure of the network impact the dynamics of the spread of an innovation or infection? This course tries to survey the mathematical results developed in the last few years on analyzing the structure of popular random networks, as well as the understanding of processes on them, with particular emphasis on epidemics. In addition it will touch on a recently very popular subject, the non-parametric modeling of a large graph via a graphon, and the related notion of graph limits. The course is loosely based on the text book “Random Graph Dynamics” by Rick Durrett (https://services.math.duke.edu/~rtd/RGD/RGD.pdf), updated to what has happened since its publication, including the topics of graphons and graph limits, plus a larger emphasis on epidemics, as well as a short introduction to the topic of the spread of information and innovation. Additional literature, including original research papers, will be provided during the course. Prerequisites: The course is open to graduate students with a good level of mathematical maturity and a strong background in probability (including some knowledge of Martingales, Markov Chains, and basic notions of stochastic processes), as well as some basic background in graph theory and differential equations. Topics: Random Graph Models and Structure of Large Networks (50-60%): • Erdos-Renyi random graphs: cluster growth, formation of the giant connected component, diameter • Models with community structure: Stochastic block model and topic models • Non-parametric models: graphons, graph limits, estimation • Differential privacy on Networks • Scale-free graphs: random graphs with a fixed degree distribution, preferential attachment model and Polya urns Epidemics Models and their Behavior (about 25%): • Basic compartmental models (SIS, SIR, etc.) • Differential Equation Approach: R0, exponential growth, size of an epidemic • Mathematically rigorous derivation of Differential Equations from the underlying dynamic model

Class Notes

This class has pre-requisites! Read them in the class description. If you have concerns about your qualifications for the class, please contact the professor.

URL for the class is: https://people.eecs.berkeley.edu/~borgs/CS294-179/

Rules & Requirements

Repeat Rules

Reserved Seats

Current Enrollment

No Reserved Seats

Textbooks & Materials

See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.

Textbook Lookup

Guide to Open, Free, & Affordable Course Materials

eTextbooks

Associated Sections

None