SI 508, SI 708, CS 608 Networks

Resources

home

508 cTools
608/708 cTools

Readings, assignments, etc. will be posted to the course ctools website

problem sets

this year's projects

projects from previous years:
fall 2007
winter 2007
winter 2006

software tools for the class

other resources

instructor:
Lada Adamic


Schedule

Fall 2008:

Mondays 4-5:30 pm
Joint lecture for SI 508, SI 708, CS 608 in WH 311 4-5:30

Wednesdays 4-5:30pm
SI 508 only: meet in the DIAD lab.

Thursdays 10:30-12:00 SI 708 and CS 608 only: meet in WH 317A (complex systems lounge) for a discussion session

Office hours:
Mondays 2-3pm
Mondays, Weds. 5:40-6:10pm




SI 508 & SI 708/CS 608 syllabus

 

  This course will cover topics in network analysis, from social networks to applications in information networks such as the internet. We will introduce basic concepts in network theory, discuss metrics and models, use software analysis tools to experiment with a wide variety of real-world network data, and study applications to areas such as information retrieval. For their final project, the students will apply the concepts learned in class to networks of interest to them.

Compared to the PhD level course (SI 708/CS 608), SI 508 will have several in-class lab sessions where we will be analyzing data sets together. It will focus more on applications to the WWW, tagging and blogging, as well as co-authorship and citation networks. It will focus less on mathematical models and algorithms.

SI 708/CS608 will focus more on recent research in the area of complex networks, and may cover these additional topics: network evolution, p* models, strategic network formation, general graph search algorithms, flow, game theory or epidemic modeling.

SI508 and SI708/CS608 will have a joint lecture on Mondays 4-5:30.

Check out a sample of the fall 2007 and fall 2008 student projects for inspiration.
Can't wait for class to start? Experiment with some of the online demos.

This course is now part of University of Michigan's Open Educational Resources initiative. You are free to use these materials (I encourage you to do so), but please use the OER version.

9/2 & 9/3 508 lab: intro to Pajek
708: what are complex networks?
508: Pajek Ch1: Looking for social structure
708: Jackson Ch.1: Introduction
9/8

basic network metrics

508/708: MEJN sections 1-3
708 start reading:
Jackson Ch.2: Representing and measuring networks
&
Jackson Ch.3: Empirical background on social and economic networks

9/10 (508)
9/9 (708)

508 PS 1 due

508 lab: Pajek lab 2
708 lab: intro to Pajek


508/708: Pajek CH2: Attributes and Relations

508/708 skim Pajek documentation
508/708 skim Graphviz documentation

9/15
708 PS 1 due
centrality and other network metrics
508/708: Wayne E. Baker and Robert R. Faulkner, The Social Organization of Conspiracy: Illegal Networks in the Heavy Electrical Equipment Industry, American Sociological Review, Vol. 58, No. 6 (Dec, 1993)
508/708: Noah E. Friedkin, 'Structural Bases of Interpersonal Influence in Groups: A Longitudinal Case Study, American Sociological Review, Vol. 58, No. 6 (Dec, 1993)
508 optional/708 optional Wasserman & Faust Ch5: Centrality and prestige
9/17&9/18
508 PS 2 due
508 lab:: centrality
708:: matrix representations, eigenvector centrality measures
508: Pajek Ch. 6: Center and Periphery
508: Pajek Ch. 9 : prestige
708: continue reading Jackson Ch 2 & 3
9/22
clustering
Milgram's small world experiment
random graphs
Watts-Strogatz small world model
 

508/708 Watts & Strogatz, 'Collective Dynamics of Small World Networks', Nature, 1998
508/708 Travers and Milgram, 'An experimental study of the small world problem'
508/708: MEJN 6: The Small World Model

9/24 & 9/25
508 PS 3 due
708 PS 2 due
508 lab: small world phenomenon in real-world networks & simulations

708: random graphs

708: Jackson Ch.4: Random Graph Based Models of Networks
708: MEJN 4,5
9/29 Zipf's Law & fat tails
preferential attachment

508: L. Adamic, Zipf, Power-laws, and Pareto - a ranking tutorial
708: Power laws, Pareto distributions and Zipf's law, M. E. J. Newman, Contemporary Physics 46, 323-351 (2005).

508/708 

MEJN 7: Models of network growth
508/708 Barabasi and Albert, 'Emergence of scaling in random networks'
10/1&10/2
508 form group
708 PS 3 due
508 lab: fitting power-laws, growing networks

708: network growth models


508 optional/708 optional: Topology of evolving networks: local events and universality, Reka Albert, Albert-Laszlo Barabasi, Phys. Rev. Lett. 85, 5234-5237 (2000) (used in Pajek)
508 optional/708 optional: Winners don't take all: Characterizing the
competition for links on the web
David M. Pennock, Gary W. Flake, Steve Lawrence, Eric J. Glover, and C. Lee Giles, PNAS, April 16, 2002, vol. 99, no. 8

708: Jackson Ch. 5: Growing Random networks
708 optional: Barrat et al.: The architecture of complex weighted networks
10/6
graph traversal

508/708 Cormen "Algorithms" Ch. 23 Elementary graph algorithms

10/8&10/9
508 project proposal due
708 project proposal due
508 lab: network analysis with GUESS
708 lab:: network analysis with GUESS
508/708 Eytan Adar, GUESS: A Language and Interface for Graph Exploration, CHI 2006
508/708 GUESS documentation
10/13

homophily
exploratory analysis of online communities
community structure


508/708: Girvan & Newman: Community structure in social and biological networks, PNAS | June 11, 2002 | vol. 99 | no. 12 | 7821-7826

508
/708 S. Feld. Social structural determinants of similarity among associates. American Sociological Review, 47, 1982.

508 optional/708 optional: L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211{230, 2003.
508 optional/708 optionalL. A. Adamic, O. Buyukkokten, and E. Adar. A social network caught in the web. First Monday, 8(6), June 2003.
508 optional/708 optional; L. A. Adamic and N. Glance. The political blogosphere and the 2004 US election: Divided they blog. In Proceedings of LinkKDD-2005, 2005.
10/15 & 10/16
508 PS 4 due
708 PS 4 due
508 lab: community structure
708:: network flow, community finding algorithms

508 Pajek Ch3: cohesive subgroups
508 Pajek Ch5: affiliations
508Pajek Ch. 12: blockmodels

708: Kleinberg & Tardos 'Network flow' in 'Algorithm Design'
708:Mark Newman: Modularity and community structure in networks
708:Newman & Leicht: Mixture models and exploratory analysis in networks, PNAS (2007).

10/20 ---- break ----  
10/22&10/23
508 PS 5 due
708 PS 5 due

508: in-lab project help
708:
epidemic spread on networks

 

708: Jackson 7.1: Diffusion through networks: spread of information and disease

10/27 search

508/708:J. M. Kleinberg. Navigation in a small world. Nature, 406:845, 2000.
508/708: D. J. Watts, P. S. Dodds, and M. E. J. Newman. Identity and search in social networks. Science, 296:1302-1305, 2002.
708: Jackson 7.2: Search and navigation on networks

508 optional/708 optional David Liben-Nowell, Jasmine Novak, Ravi Kumar, Prabhakar Raghavan and Andrew Tomkins. Geographic routing in social networks, PNAS | August 16, 2005 | vol. 102 | no. 33 | 11623-11628


508 optional/708 optional: L. A. Adamic and E. Adar. How to search a social network. Social Networks, 27(3):187-203, 200 5.

10/29&10/30

708 midterm due
508 in-class midterm
708: search


708: Adamic et al. 'Search in power law networks'
708 optional : J. Kleinberg. Small-world phenomena and the dynamics of information.Advances in Neural Information Processing Systems (NIPS), 14, 2001.


11/3 ranking algorithms and information retrieval
the Web as a graph
508/708: Broder et al, Graph Structure in the Web, 9th WWW conference, Amsterdam, May 2000.
508/708: L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
 
508 optional/708 optional: F. Menczer: Mapping the semantics of Web text and links. in IEEE Internet Computing 9(3): 27-36, May/June 2005
508 optional/708 optional: G. Erkan and D. R. Radev. Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence .
708 optional : J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
11/5 & 11/6
508 PS 6 due
508 lab: the web as a graph
708: NetLogo tutorial, agent based modeling on networks

708: NetLogo user manual, tutorials 1-3

508 optional/708 optional: F. Menczer: Mapping the semantics of Web text and links. in IEEE Internet Computing 9(3): 27-36, May/June 2005
508 optional/708 optional: G. Erkan and D. R. Radev. Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence .

 

11/10
708 PS 6 due
information diffusion 508/708 Davis, Gerald F., Yoo, Mina, Baker, Wayne E.
The Small World of the American Corporate Elite, 1982-2001 Strategic Organization 2003 1: 301-326
508/708 Mark Granovetter, The Strength of Weak Ties, The American Journal of Sociology, Vol. 78, No. 6 (May, 1973), 1360-1380.

508 optional/708 optional: Ron Burt, "Structural holes and good ideas"
508 optional/708 optional: Aral & Van Alstyne: "Network structure & Information Advantage"
508 optional/708 optional: Lazer: "The Parable of the Hare and the Tortoise: Small Worlds, Diversity, and System Performance"
11/12 & 11/13
508 mid-project report due
508 lab: diffusion
708:: learning and opinion formation
508 Pajek Ch 8: diffusion
708: Jackson Ch 8: Learning and networks
708 optional : Holme & Newman, Nonequilibrium phase transition in the coevolution of networks and opinions
11/17
708 mid-project report due
networks over time

508/708: Guimera et al. Team Assembly Mechanisms Determine Collaboration Network Structure and Team Performance, Science 29 April 2005: Vol. 308. no. 5722, pp. 697 - 702
508/708: Backstrom et al. Group formation in large social networks: membership, growth, and evolution, KDD 2006
508/708: Leskovec et al. Graphs over time: densification laws, shrinking diameters and possible explanations

11/19&11/20
508 PS 7 due
708 PS 7 due
508 lab: tagging networks
708: games on networks, strategic network formation
508 S. A. Golder and B. A. Huberman. Usage patterns of collaborative tagging systems. Journal of Information Science, 32(2):198{208, 2006.
508 optional
R. Lambiotte and M. Ausloos. Collaborative tagging as a tripartite network , Dec 2005.
508 optional C. Cattuto, V. Loreto, and L. Pietronero. Collaborative tagging and semiotic dynamics, May 2006.
708: Jackson Ch.6 Strategic network formation
11/24
network robustness

508/708: Albert et al. Error and attack tolerance of complex networks, Nature 406, 378 - 382 (2000)
508 optional/708 optional: Kinney et al: Modeling cascading failures in the North American power grid Eur. Phys. J. B 46, 101107 (2005)

11/26:
508 PS 8 due
708 PS 8 due
508 lab: robustness  
11/27 thanksgiving break, 708 doesn't meet ---
12/1
508 PS 9 due
708 PS 9 due
project presentations  
12/3 & 12/4
project presentations  
12/8 project presentations  
12/15 final project due for both 508 and 708