**Network Analysis and ModelingCSCI 5352, Fall 2016**

Time: Monday and Wednesday, 9:30am - 10:45am

Room: ECCS 1B12

Instructor: Aaron Clauset

Office: ECOT 743

Office hours: Wednesday, 1:00-2:30pm

Email: zzilm.xozfhvg@xlolizwl.vwf (an Atbash cipher)

Syllabus

**Description**

**Course work and grading**

**Schedule and lecture notes**

**Problem sets**

**Supplemental readings**

**Description**

Network science is a thriving and increasingly important cross-disciplinary
domain that focuses on the representation, analysis and modeling of complex
social, biological and technological systems as networks or graphs. Modern
data sets often include some kind of network. Nodes can have locations,
directions, memory, demographic characteristics, content, and preferences.
Edges can have lengths, directions, capacities, costs, durations, and types.
And, these variables and the network structure itself can vary, with edges and
nodes appearing, disappearing and changing their characteristics over time.
Capturing, modeling and understanding networks and rich data requires
understanding both the mathematics of networks and the computational tools for
identifying and explaining the patterns they contain.

This graduate-level course will examine modern techniques for analyzing and
modeling the structure and dynamics of complex networks. The focus will be on
statistical algorithms and methods, and both lectures and assignments will
emphasize model interpretability and understanding the processes that
generate real data. Applications will be drawn from computational biology and
computational social science. No biological or social science training is
required. (Note: this is not a scientific computing course, but there will be
plenty of computing for science.)

**Prerequisites**

Recommended: CSCI 3104 (undergraduate algorithms) and APPM 3570 (applied
probability), or equivalent preparation.

Note: An adequate mathematical and programming background is mandatory. The
concepts and techniques covered in this course depend heavily on basic
statistics (distributions, Monte Carlo techniques), scientific programming,
and calculus (integration and differentiation). Students without sufficient
preparation will struggle to keep up with the lectures and assignments.
Students without proper preparation may audit the course.

**Text**

Required (available at the CU Bookstore):

1. Networks: An Introduction by M.E.J. Newman

2. Pattern Recognition and Machine Learning by C.M. Bishop.

Optional:

1. All of Statistics by L. Wasserman

2. Numerical Recipes

3. Networks, Crowds and Markets by D. Easley and J. Kleinberg

4. Error and the Growth of Experimental Knowledge by D.G. Mayo.

**Course work and grading**

Attendance to the lectures is required.

Most of the class will be standard graduate-style lectures by the instructor.
These will be supplemented by guest lectures on special or advanced topics,
and class discussions of selected papers drawn from the networks literature.
Problem sets will develop and extend topics presented in class, and will
introduce additional topics not covered in class. Performance on the problem
sets will be the major component of evaluation. There are no written
examinations in the course, and thus students are expected to spend serious
quality time on the problem sets. Additional details are given in the syllabus.

*Problem sets*: There will be 6 problem sets. Each will include some
mathematical and some computational problems. Problem sets will be due roughly
every two weeks. Programming components of the problem sets may be completed
in any reasonable imperative language, and students are not expected to code
everything from scratch (using available network libraries is okay).

See the syllabus for more details about formatting and submitting your
solutions, for advice about how to get maximum points, and for the class
policies on collaboration and on late submissions.
Students that are unsure about whether something is permitted under the policies described in
the syllabus should consult with the instructor well before a particular
deadline.

*Class project*: The purpose of the class project is to
formulate and explore a research question of the student's devising related
to network analysis and modeling. Students may work in teams of 1-2 people.
The deliverables are a short (10 minute) in-class presentation of the project
results, and a 10-page writeup. See the syllabus for more details.

*Grading* Grades will be assigned based on (section 001) attendance
(20%), problem sets (50%), and class project (30%), or (section 740)
problem sets (63%) and class project (37%).

**Tentative Schedule**

Week 1 : Introduction and overview (Lecture 1)

Week 2 : Random graphs I: the Erdos-Renyi model (Lecture 2)

Week 3 : Measures of centrality (Lecture 3)

Week 4 : Random graphs II: the configuration model (Lecture 4)

Week 5 : Large-scale structure I: assortativity and modularity (Lecture 5)

Week 6 : Large-scale structure II: stochastic block models (Lecture 6)

Week 7 : Large-scale structure III: more block models (Lecture 7)

Week 8 : Wrangling network data I: from raw data to networks (Lecture 8)

Week 9 : Wrangling network data II: sampled networks (Lecture 9)

Week 10 : Spatial networks (Lecture 10)

Week 11 : Growing networks (Lecture 11)

Week 12 : Dynamic networks (Lecture 12)

Week 13 : Advanced topics

Week 14 : Fall break

Weeks 15-16 : Project presentations and Wrap up

**Problem Sets**

**Problem set 1**

**Problem set 2**

**Problem set 3**

**Problem set 4**

**Problem set 5**

**Problem set 6**

Week 1:

- M.E.J. Newman, "The structure and function of complex networks."
*SIAM Review***45**, 167-256 (2003). - L. Breiman, "Statistical Modeling: The Two Cultures."
*Statistical Science***16**, 199-231 (2001).

**Network Tools**

NetworkX, network analysis package (Python)

igraph, network analysis tools (Python, C++, R)

graph-tool, network analysis and visualization software (Python, C++)

GraphLab, scalable network analysis (Python, C++)

**Network Visualization**

Cytoscape, network
visualization software

yEd Graph Editor, network visualization software

Graphviz,
network visualization software

Gephi, network visualization software

graph-tool, network analysis and visualization software

webweb, network visualization tool joining Matlab and d3

MuxViz, multilayer analysis and visualization platform

**Network Data Sets**

The Colorado Index of Complex Networks (ICON; more than 3000 graphs)

US Census Education-Employment network (social, bipartite, weighted)

**Other Courses on Networks**

Network Theory (University of Michigan)

Statistical Network Analysis (Purdue University)

Networks (Cornell University)

Networks (Harvard University)

Social and Economic Networks: Models and Analysis (Coursera / Stanford)

Social Network Analysis (Coursera / University of Michigan)

Social and Information Network Analysis (Stanford)

Graphs and Networks (Yale)

Spectral Graph Theory (Yale)

The Structure of Social Data (Stanford)

**Resources**

LaTeX (general) and TeXShop (Mac)

Matlab license for CU staff (includes student employees)

Mathematica license for CU students

NumPy/SciPy libraries for Python (similar to Matlab)

GNU Octave (similar to Matlab)

Wolfram Alpha (Web interface for simple integration and differentiation)

Introduction to the Modeling and Analysis of Complex Systems, by Hiroki Sayama (free online textbook)

**Things Worth Reading**

Everything you wanted to know about Data Analysis and Fitting but were afraid to ask, by Peter Young

Machine Learning, Statistical Inference and Induction Notebook (by Cosma Shalizi)

Power Law distributions, etc. Notebook (by Cosma Shalizi)

Statistics Done Wrong, The woefully complete guide (by Alex Reinhart)

Some Advice on Process for
[Research Projects]