CS 765 Complex Networks
Department of Computer Science & Engineering
UNR, Fall 2016
Course Information 
Prerequisites 
Objective 
Description 
Topics 
Textbooks 
Tools 
Resources 
Organization 
Project 
Grading 
Schedule 
Announcements
Class hours 
Tuesday & Thursday, 2:30  3:45pm 


Class location 
SEM 257 
Instructor 
Dr. Mehmet Gunes 
Email 
mgunes <at>unr.edu 
Phone 
(775) 784  4313 
Web page 
https://www.cse.unr.edu/~mgunes 
Office 
SEM 238 (Scrugham EngineeringMines) 
Office hours 
Tuesday & Thursday 9:30  11:00 am or by appointment 
You may look at earlier courses from
Fall 2009,
Fall 2010,
Fall 2011,
Spring 2013, and
Fall 2014.
 Graduate level (any discipline)
 An adequate background in Calculus and Probability will be required.
Students who successfully complete this course will gain:
 a broad conceptual introduction to the modern theory and applications of complex networks,
 experience critiquing scientific papers,
 experience working with large, complex data sets,
 experience with technical writing and in class presentations.
Catalog Description: Theory and modeling: biological, information, social and technological networks.
Network models: scalefree, smallworld, powerlaw. Processes on networks: epidemics, resilience, search.
This course covers theory and modeling of realworld networks such as computer,
social, and biological networks where the underlying topology is a dynamically growing complex graph.
Many phenomena in nature can be modeled as a network. Researchers from many areas including
biology, computer science, engineering, epidemiology, mathematics, physics, and sociology
have been studying complex networks of their field.
Scalefree networks and smallworld networks are well known examples of complex networks
where powerlaw degree distribution and high clustering are their respective characteristic feature.
These networks have been identified in many fundamentally different systems.
Complex networks display nontrivial topological features that require an in depth study.
 Empirical Study of Networks
 Technological networks
 Information networks
 Social networks
 Biological networks
 Economic networks
 Infrastructure networks
 Fundamentals of Network Theory
 Mathematics of networks
 Graph theory
 Measures and metrics
 Largescale structure of networks
 Network Models
 Random graphs
 Random graphs with general degree distributions
 Powerlaw and scalefree graphs
 Small worlds
 Network formation
 Evolving networks
 Processes on Networks
 Percolation and network resilience
 Epidemics on networks
 Network dynamics
 Network search
 Graph data mining
 Network Visualization
 Network Science,
by AlbertLaszlo Barabasi,
(Cambridge University Press  August 2016)  freely available under the Creative Commons licence.
 Networks: An Introduction,
by Mark Newman,
(Oxford University Press  May 2010).
 Networks, Crowds, and Markets: Reasoning About a Highly Connected World,
by David Easley and Jon Kleinberg,
(Cambridge University Press  Sep 2010)  Prepublication draft available online.
 The Structure of Complex Networks Theory and Applications,
by Ernesto Estrada,
(Oxford University Press  Dec 2011).
 Dynamical Processes on Complex Networks,
by Alain Barrat, Marc Barthelemy, and Alessandro Vespignani,
(Cambridge University Press  November 2008).
 The Structure and Dynamics of Networks,
by Mark Newman, AlbertLaszlo Barabasi, & Duncan J. Watts,
(Princeton University Press  April 2006).
 Exploratory Social Network Analysis with Pajek,
by Nooy, Wouter de, Andrej Mrvar, and Vladimir Batagelj,
(Cambridge University Press, 2nd Edition  September 2011)
 Pajek: A simple network visualization tool allowing to interactively manipulate the network. (Pajek manual)
 Graphviz: A simple network visualization tool available for a variety of platforms.
 Gephi: An open visualization and exploration software.
 GUESS: An exploratory data analysis and visualization tool.
 JUNG: A Java Universal Network/Graph Framework.
 SNAP: Stanford Network Analysis Platform.
 NetLogo: A multiagent programmable modeling environment.
 UCINET: A social network visualization and analysis tool.
 iGraph: A software package for creating and manipulating undirected and directed graphs.
 NetworkX: A Python package for studying the structure, dynamics, and functions of complex networks.
 IVC: InfoVis Cyberinfrastructure is a collection of data analysis and visualization algorithms.
 Net: A program for the creation and statistical analysis of large networks.
 graphtool: A python module to help with statistical analysis.
 Except this web page, course materials will be posted at the WebCampus.
 This is not a lecture course, but an active learning opportunity with an intense engagement in research.
I'm quite confident that it will be challenging but a fun course.
 Presentation slides will be available on the class web page.
I will try to put them up before each class meeting but no guarantees on that.
 Class participation in terms of asking questions is highly encouraged.
Please do not be afraid to ask questions no matter how simple you might think the answer could be.
This type of interaction helps improve the effectiveness of the class and breaks the monotony.
 Students are encouraged to bring articles, demos, web pages, news events, etc. that are relevant to course topics to the attention of the instructor.
The underlying notion of the class is interaction, not passivity.
The success of the course depends on everyone in the class engaging the material and bringing energy, enthusiasm, and intellect to class activities.
 Unless instructed otherwise, use of electronic devices including laptops and smart phones are not allowed during lectures.
 Attendance at all class meetings is mandatory and will affect your grade.
You should arrive on time and be prepared to discuss the session's topic.
 Being a graduate course, you are primarily responsible for participating in the discussion.
You are expected to read relevant papers and chapters for each session and be prepared to discuss and comment on the material.
 Each student will prepare a research project on a complex network of their choice.
The expected outcome of the project is a research paper that can be published at a quality conference.
Requiring major effort from you, the project will help in learning the culture and practice of scientific research.
Your writing should be clear, engaging, technically sound, and written in an appropriate style for an academic publication.
Late submission during project stages will be penalized by 10% per day, except holidays.
Assignments will be accepted only through WebCampus.
 You would be required to prepare reports for each stage of the project.
The first project report will be an abstract submission of the project idea.
The second report will require each student to carry out a thorough review of the research related to his/her project and become the background and related work sections of the final paper.
The third report will cover the methodology of research project providing details of the approach/idea.
Final report will include complete paper with Introduction, Related Work, Methodology, and Evaluations sections.
 The course will require students to prepare two 30 min and one 15 min in class presentations.
You will be graded by your peers using the presentation evaluation form.
However, final grade will be decided by instructor.
In the first presentation, each student will present the background of his/her project.
The second presentation will cover the methodology of the research project.
The final presentation should present your findings and will be delivered on the final exam day.
There are several online resources, such as Research talk 101,
Presenting Your Research: Papers, Presentations, and People,
What Makes for a Good Research Presentation?,
Using PowerPoint to Design Effective Presentations, and
PowerPoint as a Powerful Tool.
 You will critique your peer's papers using paper review form.
The goal of this critique is to become familiarized with paper review process and to provide feedback to your fellows in the class.
 There will be seven inclass quizzes. The lowest graded one will not affect your overall grade.
Exact date for these quizzes will not be exposed beforehand.
These quizzes will be open book/notes and timeconstrained, i.e., 1520 mins.
Questions in these quizzes will be designed to give you an opportunity to test and affirm your knowledge of the course content.
 There will be five lab assignments where you will have hands on experience on complex networks.
These assignments will require you to use several tools (such as Pajek and GUESS) to analyse sample networks.
Late submission will be penalized by 20% per day, except holidays.
 You are welcome to discuss the problems or solution strategies with your class mates but the resulting work should be your own.
Copying from each other or from other sources is considered as cheating.
 Academic Dishonesty:
Cheating, plagiarism or otherwise obtaining grades under false pretenses constitute academic dishonesty according to the code of this university. Academic dishonesty will not be tolerated and penalties can include canceling a student's enrollment without a grade, giving an F for the course or for the assignment. For more details, see the University of Nevada, Reno General Catalog.
 Academic Success Services:
Your student fees cover usage of the University Math Center (775) 7844433, University Tutoring Center (775) 7846801, and University University Writing Center (775) 7846030. These centers support your classroom learning; it is your responsibility to take advantage of their services. Keep in mind that seeking help outside of class is the sign of a responsible and successful student.
 Disability Statement:
Any student with a disability needing academic adjustments or accommodations is requested to speak with the Disability Resource Center (Pennington Student Achievement Center, Suite 230) as soon as possible to arrange for appropriate accommodations.
 Class Recording:
Surreptitious or covert videotaping of class or unauthorized audio recording of class is prohibited by law and by Board of Regents policy. This class may be videotaped or audio recorded only with the written permission of the instructor. In order to accommodate students with disabilities, some students may be given permission to record class lectures and discussions. Therefore, students should understand that their comments during class may be recorded.
The main component of your grade is a research project that may materialize as a paper.
If your project has a significant computational component (e.g., downloading and analyzing a network dataset), then you may work with a partner after consulting with the instructor.
The paper will be judged on the following criteria:
 Insight: Your paper should be more than just a recapitulation of existing work, or just raw analysis of data.
You should make an effort to provide insight to the reader: for example, what is the data telling us about the networked system?
 Command of relevant course material: Your paper should connect to the main themes of the course,
and your coverage of the related material should demonstrate competence with the content of the project.
 Clarity: You must clearly articulate the problem(s) or question(s) you are addressing;
your methodology and approach; and your insights, solutions, and remaining open questions.
 Rigor and precision: Your paper must be mathematically precise where necessary, and rigorous and logical in its reasoning throughout.
Any methodology used should be justified, and limitations or assumptions should be clarified.
Following are sample project topics:
 Dataset analysis: Obtain and analyze a network dataset (e.g., by downloading a dataset online, or by crawling an online service).
You may perform conceptually or theoretically new experiments with existing datasets. Note that such projects require time to collect data.
 Network formation: Choose a specific applied domain, and discuss how networks form in that domain.
For example, you might discuss the formation and dissolution of contracts among Internet service providers;
the formation of links in social networks; or the evolution and dissolution of political alliances.
 Theory development: Propose a new theoretical direction and specify a research agenda.
You might develop a new method to analyze networks (e.g., dynamic characteristics of biological networks).
 Characterization of epidemics: Study several specific examples of epidemic phenomena,
such as: fads in online content; virus and worm spreading in information networks; and wordofmouth in product marketing.
Both grading policy and scale are subject to change.
Grading Policy
45  Project (Abstract:3, Related Work:10, Methodology:10, Final paper:22)
12  Presentations (2 + 1/2)
10  Paper critique
15  Labs (5)
18  Quizzes (6 of 7)
Grading Scale
A : [92  100]
A : [88  92)
B+ : [84  88)
B : [80  84)
B : [76  80)
C+ : [72  76)
C : [68  72)
C : [64  68)
D+ : [60  64)
D : [56  60)
D : [52  56)
F : [0  52) or caught cheating
Important Note: You will have one week to appeal for your grades after the graded assignments/tests are returned.
So, please keep this in mind if you think that there is a problem/issue with the grading of your work.
This is a tentative schedule including the assignment dates.
It is subject to readjustment depending on the time we actually spend in class covering the topics.
Date 
Lectures 
Assignments & Notes 
Tue, Aug 30 
Lecture #1: Introduction 
Connected: The Power of Six Degrees 
Thu, Sep 1 
Lecture #2: Empirical Study of Networks 

Tue, Sep 6 
Lecture #3: Mathematics of Networks 
Project Ideas 
Thu, Sep 8 
Lecture #4: Mathematics of Networks 

Tue, Sep 13 
Lecture #5: Centrality 
Project Abstract due 
Thu, Sep 15 
Lecture #6: Centrality 

Tue, Sep 20 
Lecture #7: Centrality 
Lab 1 due 
Thu, Sep 22 
Lecture #8: Community Structures 

Tue, Sep 27 
Lecture #9: Community Structures 

Thu, Sep 29 
Lecture #10: Measures and Metrics 
Lab 2 due 
Tue, Oct 4 
Lecture #11: Network Models 

Thu, Oct 6 
Lecture #12: Network Models 

Tue, Oct 11 
Lecture #13: Network Models 
Research talk 101 
Thu, Oct 13 
Lecture #14: Language Exploration  Parallel Metric Calculation 
Related Work report due 
Tue, Oct 18 
Lecture #15: Author Influence  Fungi Networks 

Thu, Oct 20 
Lecture #16: Customer Reviews  Soccer Network 
Lab 3 due 
Tue, Oct 25 
Lecture #17: Wikipedia Network  PoP Level Internet 

Thu, Oct 27 
Lecture #18: Internet Topology Data  Topology Resolution 
Lab 4 due 
Tue, Nov 1 
Lecture #19: Terrorist Networks  Recommender Network 

Thu, Nov 3 
Lecture #20: Internet Topology Data Topology Resolution 

Tue, Nov 8 
Lecture #21: Author Influence  Terrorist Networks 
Methodology report due 
Thu, Nov 10 
Lecture #22: Wikipedia Network  Network Dynamics 

Tue, Nov 15 
Lecture #23: Soccer Network  Parallel Metric Calculation 

Thu, Nov 17 
Lecture #24: Language Exploration  Fungi Networks 
Paper critique 1 due on Friday 
Tue, Nov 22 
Lecture #25: Recommender Network  PoP Level Internet 

Thu, Nov 24 
Thanksgiving (no class) 

Tue, Nov 29 
Lecture #26: Network Dynamics  Network Evolution 
Paper critique 2 due 
Thu, Dec 1 
Lecture #27: Network Resilience 

Tue, Dec 6 
Lecture #28: Network Resilience  Search in Networks 

Thu, Dec 8 
Lecture #29: Information Diffusion 

Tue, Dec 13 
Lecture #30: Information Diffusion 
Lab 5 due 
Thu, Dec 15 
Final Project Presentations @ 12:30pm 
Final report due on Dec 20 
Announcements regarding the course will be posted on this web page
and sent by email to your UNR email account.
Please daily check your UNR email.
 Aug 27 : You can find nice figures of complex networks at www.visualcomplexity.com.
 Dec 8 : Office hours on Monday, Dec 12 between 121:30pm instead of Dec 13th.
Course Information 
Prerequisites 
Objective 
Description 
Topics 
Textbooks 
Tools 
Resources 
Organization 
Project 
Grading 
Schedule 
Announcements
Last updated on Dec 12, 2016