Network Science Week 3:
Graph Theory I
Graph Theory I
Last week, we focused on real-world examples of networks and uses of network science. This week, we start a two-week sequence focusing on the mathematics of networks, graph theory. In this sequence, we will learn more terminology, topics, and techniques from graph theory that we will use in our study of networks.
To make progress on the learning objectives, you should complete the following tasks this week:
Read Newman Sections 6.1 through 6.9
Watch the associated content videos
Complete Project Milestone Week 3
By the end of the week, you should be able to:
Compute the adjacency matrix of a given network, and draw a network represented by an adjacency matrix
Compute the incidence matrix of a bipartite network, and draw a network represented by an incidence matrix
Transform a hypergraph into a bipartite network
Draw both one-mode projections of a bipartite network onto each of its types of nodes
No activity this week. Instead, you will complete Project Milestone Week 3:
Share the project idea you included (or plan to include) in your Project Milestone - Week 3 submission. You do not have to be as detailed as in the assignment, and you do not have to share your data. However, you might describe the network and describe the data. It's okay to pose a question here as well. For example, if you are not sure how to define the edges in your network based on the data you have, tell us about that and see if anyone can offer a suggestion.
Week 3 - Overview and Assignments (6:08)
Week 3 - Representations of a Network and the Adjacency Matrix (18:04)
Week 3 - Weighted Networks (8:19)
Week 3 - Directed Networks (16:28)
Week 3 - Hypergraphs and Bipartite Networks (22:19)
Week 3 - Multilayer and Dynamic Networks (11:08)
Week 3 - Planar Graphs (22:32)