SI 708/ CSCS 535 Networks: Theory and Application

Resources

SI708 home

cTools site

assignments

software tools

related courses


Schedule

Winter 2007:

Tuesdays/Thursdays
10:00-11:30am

in

245 Dennison

Office hour:
Weds. 5-6pm
3082 West Hall




SI 708 syllabus

 

Missed the class? You can still play with some online demos here.

For fall 2007 click here.

Check out a subset of student projects for winter 2007:


Nathan Oostendorp
Using Networks to Visualize and Understand Participation on SourceForge.net
Xiaodong Shi:
Social Network Analysis of Web Search Engine Query Logs
Brian Karrer:
"Resource Allocations on Networks"
Ben Congleton and Satyendra Nainwal:
Mining the Mine: Network Analysis of the Reality Mining Dataset
Joe Golden and John Umbaugh:
A Network Approach for Exploring Television Show-Commercial Message Interactions
Kate Anderson:
Information-driven Network Dynamics

Min-seok Pang:
An Exploratory Study on the Relationship
Between OSS Project Popularity and Network Characteristics

Arzucan Ozgur: Co-occurrence Network of Reuters News
published as

Arzucan Ozgur, Burak Cetin, and Haluk Bingol. Co-occurrence Network of Reuters News. International Journal of Modern Physics C (IJMPC), Volume 19, Issue 5, pp.689-702, 2008.

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 masters level course (previously SI 614, now SI 508, not offered in 06/07), SI 708 will have a greater emphasis on mathematical modeling and algorithms, as well as serve as a broader survey of current research in network science. In addition to covering most of the topics in SI 614 it will cover network evolution, p* models, biological networks, agent based modeling, general graph search algorithms, flow, or epidemic modeling. It will have less of an emphasis on use of software tools.

 

 

 

There are two primary readings:

The structure and function of complex networks, M. E. J. Newman, SIAM Review 45, 167-256 (2003). (here refered to as MEJN)

Exploratory Social Network Analysis with Pajek by Wouter de Nooy, Andrej Mrvar and Vladimir Batagelj  (here referred to as Pajek)

Jan. 4 course intro  
Jan. 9 basic network metrics,
intro to Pajek
Pajek Ch1: Looking for social structure
Jan. 11 network visualization
data sampling methods
clustering


Pajek CH2: Attributes and Relations

Linton Freeman, 'Visualizing Social Networks', JOSS

optional Rowland Atkinson and John Flint, 'Accessing Hidden and Hard-to-Reach Populations: Snowball Research Strategies'

Jan. 16 Pajek lab

 

Jan. 18
PS 1 due
Milgram's small world experiment
Watts-Strogatz small world model

Watts & Strogatz, 'Collective Dynamics of Small World Networks', Nature, 1998

MEJN-SF 6: The Small World Model

Travers and Milgram, 'An experimental study of the small world problem'


Jan. 23 Zipf's Law & fat tails, plotting & fitting distributions

L. Adamic, Zipf, Power-laws, and Pareto - a ranking tutorial

Power laws, Pareto distributions and Zipf's law, M. E. J. Newman, Contemporary Physics 46, 323-351 (2005).


Jan. 25
PS 2 due

random graphs,
networks in NetLogo
preferential attachment


MEJN IV: Random Graphs

Barabasi and Albert, 'Emergence of scaling in random networks'

MEJN VII: Models of network growth

Optional: Topology of evolving networks: local events and universality, Reka Albert, Albert-Laszlo Barabasi, Phys. Rev. Lett. 85, 5234-5237 (2000) (used in Pajek)

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


Jan. 30 BFS & DFS
(we'll be using slides by Prof. Plaisted at UNC: and )

Cormen, 'Algorithms': Elementary graph algorithms

optional: Ch 3 of Kleinberg and Tardos, 'Algorithm Design'

Feb. 1
PS 3 due
centrality, betweenness

Pajek Ch. 6: Center and Periphery

optional: 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)

optional: Noah E. Friedkin, 'Structural Bases of Interpersonal Influence in Groups: A Longitudinal Case Study, American Sociological Review, Vol. 58, No. 6 (Dec, 1993)

optional M. E. J. Newman, Who is the Best Connected Scientist? A Study of Scientific Coauthorship Networks.


Feb. 6
project proposal due
strength of weak ties

Mark Granovetter, The Strength of Weak Ties, The American Journal of Sociology, Vol. 78, No. 6 (May, 1973), 1360-1380.

Feb. 8
PS 4 due
prestige

Pajek Ch9: prestige

optional Wasserman & Faust Ch5: Centrality and prestige

Feb. 13

structural similarity

homophily
exploratory analysis of online communities

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

optional: L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211{230, 2003.

optional: L. A. Adamic, O. Buyukkokten, and E. Adar. A social network caught in the web. First Monday, 8(6), June 2003.

optional: L. A. Adamic and N. Glance. The political blogosphere and the 2004 US election: Divided they blog. In Proceedings of LinkKDD-2005, 2005.

Feb. 15
guest lecture by Mark Newman: community structure Modularity and community structure in Networks, M. E. J. Newman, PNAS | June 6, 2006 | vol. 103 | no. 23 | 8577-8582
Feb. 20
PS 5 due
exploratory network analysis with GUESS

Eytan Adar, GUESS: A Language and Interface for Graph Exploration, CHI 2006

GUESS documentation

Feb. 22
take home midterm due
weighted networks
minimum spanning trees, flow

Barrat et al.: The architecture of complex weighted networks

Kleinberg and Tardos, 'Network Flow' in 'Algorithm Design'

  ---- break ----  
Mar. 6 biological networks
motifs
E. Alm and A. P. Arkin. Biological networks. Curr Opin
Struct Biol, 13(2):193-202, April 2003.

R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen-Orr, I. Ayzenshtat, M. Sheffer, and U. Alon. Superfamilies of evolved and designed networks. Science, 303(5663):1538--1542, March 2004.

R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network Motifs: Simple Building Blocks of Complex Networks. Science, 298(5594):824--827, 2002. optional E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A. L. Barabasi. Hierarchical organization of modularity in metabolic networks. Science, 297(5586):1551{1555, August 2002.
Mar. 8
PS 6 due

robustness

 

Error and attack tolerance of complex networks
Reka Albert , Hawoong Jeong & Albert-Laszlo Barabasi
Nature 406, 378 - 382 (27 July 2000)

optional: Modeling cascading failures in the North American power grid R. Kinney, P. Crucitti, R. Albert, and V. Latora
Eur. Phys. J. B 46, 101107 (2005)

Mar. 13

mo' community structure

 

Pajek Ch3: cohesive subgroups

Pajek Ch5: affiliations

Pajek Ch7: brokers and bridges

Guimera et al. Team Assembly Mechanisms Determine Collaboration Network Structure and Team Performance, Science 29 April 2005: Vol. 308. no. 5722, pp. 697 - 702

Mar. 15
project status report due

search

J. M. Kleinberg. Navigation in a small world. Nature, 406:845, 2000.

D. J. Watts, P. S. Dodds, and M. E. J. Newman. Identity and search in social networks. Science, 296:1302-1305, 2002.

MEJN VIII.C Search in networks

optional: J. Kleinberg. Small-world phenomena and the dynamics of information.Advances in Neural Information Processing Systems (NIPS), 14, 2001.

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

Adamic et al. 'Search in power law networks', Phys. Rev. E 64, 046135 (2001)

Mar. 20 epidemics in networks

R. Pastor-Satorras and A. Vespignani, Epidemics and immunization in
scale-free networks

optional: M. E. J. Newman, Spread of epidemic disease on networks

optional: Vittoria Colizza, Alain Barrat, Marc Barthélemy, and Alessandro Vespignani. The role of the airline transportation network in the prediction and predictability of global epidemics. PNAS | February 14, 2006 | vol. 103 | no. 7 | 2015-2020

Mar. 22
PS 7 due
information diffusion

Davis, Gerald F., Yoo, Mina, Baker, Wayne E.
The Small World of the American Corporate Elite, 1982-2001 Strategic Organization 2003 1: 301-326

Holme & Newman: Coevolution of networks and opinion

optional: Christopher Marquis and Gerald F. Davis, “Golfing alone? Elite cohesion and community social capital, 1986-1998.”

Mar. 26 no class

please attend a networks seminar instead

Mar. 28
PS 8 due
Erik Johnston guest lecture

optional: N. Nan, E. W. Johnston, and J. S. Olson, 'Unintended consequences in central-remote office arrangement: a study coupling laboratory experiment with multi-agent simulation'.

Apr. 3 networks over time

G. Kossinets and D. J. Watts. Empirical analysis of an evolv-
ing social network
. Science, 311(5757):88-90, January 2006.

J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05, New York, NY, USA, 2005.

Apr. 5
PS 9 due
ranking algorithms and information retrieval

Broder et al, Graph Structure in the Web, 9th WWW conference, Amsterdam, May 2000.

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.  

G. Erkan and D. R. Radev. Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence .

J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.

Apr. 10 online communities 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
Apr. 12 project presentations  
Apr. 17 project presentations  
Aprl. 24 final report due