Complex Systems 535/Physics 508, Fall 2017: Network Theory

Instructor: Mark Newman
Office: 322 West Hall
Office hours: Monday 2-4pm
Email: mejn@umich.edu

Quick links:

• Homework problem sets
• Syllabus and reading assignments

Description:

This course will introduce and develop the mathematical theory of networks, particularly social and technological networks, with applications to network-driven phenomena in the Internet, search engines, network resilience, epidemiology, and many other areas.

Topics to be covered will include experimental studies of social networks, the world wide web, information and biological networks; methods and computer algorithms for the analysis and interpretation of network data; graph theory; models of networks including random graphs and preferential attachment models; community structure; percolation theory; network search.

Requirements

Students should have studied calculus and linear algebra before taking the course, and should in particular be comfortable with the solution of linear differential equations and with the calculation and properties of eigenvalues and eigenvectors of matrices. In addition, a moderate portion of the course, perhaps two weeks, will deal with computer methods for analyzing networks. Some experience with computer programming will be a great help in understanding this part of the course.

Coursework

There will be weekly graded problem sets, consisting of questions on both theory and applications. There will be three midterm exams but no final. The midterms will be in class at the usual time on October 19, November 16, and December 12.

There will be reading assignments for each lecture. The assignments are listed on the schedule below. Students are expected to do the reading for each lecture in a timely manner.

Course packs and books

Course packs (required): There is no textbook for this course but there are two course packs. The first covers the first part of the semester up to the first midterm exam; the second covers the remainder of the semester. Both are available now from Dollar Bill Copying on Church Street. Ask for CMPLXSYS 535, Bin #6081 (course pack 1) or Bin #6118 (course pack 2).

In addition to the course packs, a list of relevant books is given below. None of them is required, but you may find them useful if you want a second opinion or more detail on certain topics.

General books on networks:

• Networks: An Introduction, M. E. J. Newman, Oxford University Press, Oxford (2010). Written by your instructor, this book covers most of the material in the course, but is somewhat out of date in this fast-moving field. The course pack is more up-to-date.
• Complex Networks: Structure, Robustness and Function, Reuven Cohen and Shlomo Havlin, Cambridge University Press, Cambridge (2010). Quite a short book, but it covers most of the topics of the course, at least to some extent, and some others that are not in the book by Newman.
• Lectures on Complex Networks, S. N. Dorogovtsev, Oxford University Press, Oxford (2010). Very short – genuinely a set of lecture notes, rather than a full text.
• Network Science, A.-L. Barabasi, Cambridge University Press, Cambridge (2016). An undergraduate-level text on networks, this book is at a more elementary level than the course, but gives a nice introduction to some of the topics. It is available for free on the internet here.

Books on specific networky topics:

• R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Upper Saddle River, NJ (1993)
• A. Barrat, M. Barthelemy, and A. Vespignani, Dynamical Processes on Complex Networks, Cambridge University Press, Cambridge (2008)
• G. Caldarelli, Scale-Free Networks: Complex Webs in Nature and Technology, Oxford University Press, Oxford (2007)
• S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks, Oxford University Press, Oxford (2003)
• A. Degenne and M. Forse, Introducing Social Networks, Sage, London (1999)
• D. Easley and J. Kleinberg, Networks, Crowds, and Markets, Cambridge University Press, Cambridge (2010)
• F. Harary, Graph Theory, Perseus, Cambridge, MA (1995)
• M. O. Jackson, Social and Economic Networks, Princeton University Press, Princeton, NJ (2008)
• C. D. Meyer, Matrix Analysis and Applied Linear Algebra, SIAM, Philadelphia, PA (2000)
• M. E. J. Newman, A.-L. Barabasi, and D. J. Watts, The Structure and Dynamics of Networks, Princeton University Press (2006)
• R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet, Cambridge University Press, Cambridge (2007)
• J. Scott, Social Network Analysis: A Handbook, 2nd edition, Sage, London (2000)
• S. Wasserman and K. Faust, Social Network Analysis, Cambridge University Press, Cambridge (1994)
• D. J. Watts, Six Degrees: The Science of a Connected Age, Norton, New York (2003)
• D. B. West, Introduction to Graph Theory, Prentice Hall, Upper Saddle River, NJ (1996)
• R. J. Wilson, Introduction to Graph Theory, 4th edition, Addison-Wesley, Reading, MA (1997)

Problem sets:

• Homework 1 – Mathematics of networks
• Homework 2 – Graph theory and centrality
• Homework 3 – Network metrics
• Homework 4 – Algorithms and statistics
• Homework 5 – Random graphs
• Homework 6 – The configuration model
• Homework 7 – Generating functions and growing networks
• Homework 8 – Community structure and percolation

Data:

• In-class social network
• Internet data

Syllabus