I started this course late, so I’m already a week behind. I’ll be doing some extra work this weekend to get caught up. All in all, it’s an interesting course!

The software being using for this course includes:

• Gephi = visualization and basic network metrics
• NetLogo = modeling network dynamics
• iGraph = for programming assignments

Week 1 basic terms:

Strongly Connected Components: A directed graphic is called strongly connected if there is a path from each node (aka vertex) in the graph to every other node. This means that a complete path should exist: a path from a to b and also a path from b to a. A path can also be looked as a complete loop. Wikipedia

In-degree Distribution: the number of incoming edges to a specific node.

The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network.

If a network is directed, meaning that edges point in one direction from one node to another node, then nodes have two different degrees, the in-degree, which is the number of incoming edges, and the out-degree, which is the number of outgoing edges.