**To the Bottom
of the Page**

Instructor: Dr. Shieu-Hong Lin

Email:

Class: MW 12:00-1:15 pm at BUSN 210 PC Lab

(ii)
Monday, Wednesday, Thursday: 3:00~5:00pm: **email Dr. Lin in advance to set up an
appointment**

Important notes:

¡P Overview of the course: syllabus

¡P About the weekly progress reports on reading, lab experiments, and coding

*************************************************************************************************

**Week 1:** **Graph Theory and Social Networks:
An Overview**

**Progress report #1on reading, lab experiments, coding: **due: Wednesday, Sept. 6

Submit your progress report on
Canvas

¡P Chapter 1. Overview in *Networks,
Crowds, and Markets: Reasoning About a Highly Connected World*.

¡P
Preface, prelude, Appendix A and C in *Mining the Social Web*, 2^{nd}
Ed.

¡P Explore the articles about Facebook news feed
and more: 1, 2,
3

¡P Install IPython
Notebook for Mining the Social Web, 2nd Edition**.**

**Discussion #1 on **IPython** **Notebook**: **due: Wednesday, Sept. 6

Submit your discussion on Canvas

*************************************************************************************************

**Week 2:** **Basics of** **Graphs |
Twitter and Its API**

**Progress report #2 on reading, lab experiments, coding: **due: Wednesday, Sept. 13

Submit your progress report on
Canvas

¡P William, Matthew, and others who were able to make it work to some
extent will (i) demonstrate what they can now do with
IPython Notebook and (ii) describe the technical
glitches they got over to make something happen.

¡P Ask questions and get feedback in the class if
you have problems to make IPython Notebook work,

¡P Chapter 2. Introduction
to Graphs in *Networks, Crowds, and Markets: Reasoning
About a Highly Connected World*.

¡P Roughly
browse Chapter 1 (Twitter) of *Mining the
Social Web*, 2^{nd} Ed.

**Lab experiments on graphs and data structures
in C++:**

¡P On graphs and Euler circuits

1.
Read this Wikipedia article to learn about Euler circuits in graphs.
Download this zip
file to examine a power point slide
set on Euler circuits, a basic code framework folder, a sample executable
EulerCircuit.exe, and sample graphs such as *graph1.txt*
and *biolaGraph.txt* in it.

2.
Write down a graph of your choice and encode the
adjacency relation between the vertices as a text file *myGraph.txt* following the format used in *graph1.txt* and *biolaGraph.txt*.

3.
Run EulerCircuit.exe and use it to find Euler circuits
for graphs encoded in *graph1.txt,
biolaGraph.txt* and *myGraph.txt*.

*************************************************************************************************

**Week 3:** **Strong and Weak Ties | Twitter and Its API**

**Progress report #3 on reading, lab experiments, coding: **due: Wednesday, Sept. 20

Submit your progress report on
Canvas

¡P Chapter 3. Strong and
Weak Ties in *Networks, Crowds, and Markets: Reasoning About a Highly Connected World*.

¡P
Review Chapter 1 (Twitter) of *Mining the Social Web*, 2^{nd}
Ed.

¡P Browse
the Wikipedia article on Twitter

**Lab experiments with Twitter:**

¡P Create a Twitter account (if you don¡¦t have one yet) and sign in to play with it.

¡P
Play with the sample programs in Chapter 1
(Twitter) of *Mining the Social Web.*

**Lab experiments on graphs and data structures
in C++:**

¡P On graphs and Euler circuits

1.
Read this Wikipedia article to learn about Euler circuits in graphs.
Download this zip
file to examine a power point slide
set on Euler circuits, a basic code framework folder, a sample executable
EulerCircuit.exe, and sample graphs such as *graph1.txt*
and *biolaGraph.txt* in it.

2.
Write down a graph of your choice and encode the
adjacency relation between the vertices as a text file *myGraph.txt* following the format used in *graph1.txt* and *biolaGraph.txt*.

3.
Run EulerCircuit.exe and use it to find Euler circuits
for graphs encoded in *graph1.txt,
biolaGraph.txt* and *myGraph.txt*.

**Discussion #2 **on **graphs and data structures in C++: **due: Wednesday, Sept. 20

¡P Report what you have done and observed in the lab experiments on graphs and Euler circuits above.

¡P Apply
your understanding of C++

Submit your discussion on Canvas

About research on the strength of weak
ties: 1, 2, 3

*************************************************************************************************

**External resources:**

¡P List all example programs in Mining the Social Web, 2nd Edition.

¡P On the installation of IPython Notebook for Mining the Social Web, 2nd Edition: 1

*************************************************************************************************

**To the Top of the Document of the Page**

.