Parallel Graph Analysis, Fall 2017
Class Info   |   Assignments   |   Lecture Notes   |   Project Info

Class Info

Syllabus
Meeting times: Monday and Thursday, 16:00-17:50 in 106 Carnegie
No Class: September 4; October 9; November 13, 16, 23
Yes Class: October 10; November 20

Course Instructor:
Prof. George M. Slota
gmslota@gmail.com
Office Hours: Wednesday at 14:00-16:00 in 317 Lally (and by appointment)

Class Info


Class Resources:
TextsPapersDatasets
Networks, Crowds, and Markets - Easly, Kleinburg
Network Science - Barabasi
Mining of Massive Datasets - Leskovec, Rajaraman, Ullman
Thinking Like a Vertex
Thinking Like a Graph
Standford Large Network Dataset Collection
UF Sparse Matrix Collection
Koblenz Network Collection
Laboratory for Web Algorithmics
Mark Newman's Collection
DIMACS Challenge Graphs
Index of Complex Network

Assignments

All assignments are due (emailed to slotag@rpi.edu) before class on the scheduled date!

TopicDue DateAssignmentFilesSolution
Assignment 1: Parallel SCC 28 Sept Description   |   Code Test Data   |   1   |   2   |   3   |   4 Code
Assignment 2: Running on CCI Clusters 16 Oct Description   |   tarball Form 1   |   Form 2 Not Yet

Lecture Notes and Readings

Note: Class schedule subject to change.

WeekClass DateTopicReadingsSlides and CodeOther Resources
1 31 Aug Lecture 1: Syllabus and Course Overview Syllabus Basic I/O Code Intro to network analysis   |   More intro   |   Even more intro   |   Network Theory
2 4 Sept Labor Day: No class
7 Sept Lecture 2: Graph Processing Basics and OpenMP 2.1-2.4 Thinking Like a Vertex Code   |   Final Code   |   Data1 Data2 Data3 Processing Models   |   Graph Representation   |   OpenMP Tutorial   |   OpenMP Site
3 11 Sept Lecture 3: Connectivity Wiki on Connectivity Code   |   Final Code Graph Connectivity Algorithms   |   Vertex-centric Connectivity Algorithms   |   Flow, Cuts, and Connectivity
14 Sept Lecture 4: Centrality and the Web Graph Ch. 13-14   |   Wiki on Centrality Code   |   Final Code   |   Data1   |   Data2   |   Data3   |   Data4 Pagerank   |   Web Graph 1   |   Web Graph 2
4 18 Sept Lecture 5: Community Detection 1 Louvain Algorithm   |   Label Propgation   |   Evaluating Communities Code   |   Final Code Louvain Code
21 Sept Lecture 6: Community Detection 2 LFR Benchmark   |   Resolution Limit   |   Mutual Information   |   Adjusted Mutual Information Code   |   R-O-C code LFR Code
5 25 Sept Lecture 7: Introduction to MPI MPI Overview Code   |   Final Code Livermore MPI Tutorial   |   MPI Tutorials
28 Sept Lecture 8: MPI 2 Code
6 2 Oct Lecture 9: Graph Partitioning Code   |   METIS   |   Test Graph 1   |   METIS Format 1   |   METIS-M Format 1   |   Test Graph 2   |   METIS Format 2   |   METIS-M Format 2   |   Test Graph 3   |   METIS Format 3   |   Partitioning Overview   |   FENNEL
5 Oct Lecture 10: Graph Ordering and Compression Code   |   Final Code   |   Mesh   |   R-MAT Graph   |   Road Network WebGraph Framework
7 10 Oct Lecture 11: Random Graphs Erdos-Renyi Xorshift Barabasi-Albert R-MAT Code   |   Final Code Xorshift
12 Oct Lecture 12: Graph Sampling Sampling Social Networks   |   Random Walks Code   |   Final Code Spectral Sparsification   |   Community Detection via Sampling
8 16 Oct Lecture 12: Graph Sampling 2 Code

Project Info


Important Dates:

ItemDue DateDescription
Project Proposal 21 Sept.
Progress Presentation 1 19 Oct Prepare a few slides describing initial progress to present to classmates
Progress Presentation 2 TBD
Final Presentation 7 Dec
Final Report 10 Dec