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

We live in a world of networks: from our physical social network, to online networks and the WWW, to the miscroscopic networks describing, e.g, pathways in cancer cells, to name three examples. The goal of this class is to learn how these networks work. In particular, we will study several interrelated aspects of networks: Networks as structures used to describe various interactions (from social interactions between people to chemical interactions between proteins), Networks as the fabric on which various economic, social and technological processes happen (from the spread of (dis)information and epidemics to PageRank, which happens to be a probabilistic process on the graph describing the WWW), Graph algorithms (algorithms to determine various properties of networks). The course is a new course, roughly at the level of difficulty and mathematical abstraction as CS174, but obviously with a different thematic focus. While there is no book which covers exactly what I will cover here, most of the material can be found in the book Networks, Crowds, and Markets: Reasoning About a Highly Connected World by David Easley and Jon Kleinberg, albeit written in a less mathematical language than I will use in my lectures. Courses I will be modelling mine after are this and this course at Cornell, and this course at Caltech.

* Manually enforced prerequisites: CS70, AND either EECS126 or CS170

* Class website: https://people.eecs.berkeley.edu/~borgs/CS194-SP22/

Requisites

• Students not in the Master of Engineering Program

Repeat Rules