Network or Graph Theory
A graph is defined as a set of edges and a set of vertices. A multi-graph is a graph with multiple edges between the nodes.
Undirected graphs include two nodes with an edge that does not indicate directionality -- an unordered pair (Jane is married to Paul. Paul is married to Jane).
Directed graphs include edges which do indicate clear directionality (flow and order). Edges in a directed graph may be weighted, in that certain edges are given a weighted number (for example $100 million in import/ $150 million in export).
Multiplex Networks capture how different networks interrelate and overlap to effect each other.
Vertices
Vertexes are things (nodes).
All nodes (things like people, molecules, objects) have properties that can be quantified.
Edges
Edges are a relation of some sort between two nodes.
This connection or relation between nodes can be physical (like underwater cables physically connecting networks or roads between cities) or intangible (like social relationships).
Edges are also known as links, ties, or relations,
The nodes belonging to an edge are called the ends, endpoints, or end vertices.
(Systems Innovation, April 18, 2015)
Network Connectivity
How connected an individual node is becomes a key metric of its significance within the network. The degree of connectivity is related to the number of edges or connections a node has. In other words, a nodes degree of connectivity is its "immediate likelihood of catching whatever is flowing through the network" (Systems Innovation, April 19, 2015). Increased connectivity is typically viewed as positive, but this is not always true (virus vs juicy gossip).
In and Out Degree
They are a measure of in and out links.
With weighted graphs, we can place a quantitative value on each edge
Adjacency Matrix
Two nodes are considered adjacent if they are connected via a single edge.
We can capture all the relations (connections) within a network using and adjacency matrix.
Walks
a sequence of adjacent vertices where repetition is allowed.
Path
a walk without revisiting any nodes -- repetition is not allowed.
Geodesic
The shortest and fewest number of links to travers from any given node to another.
Page References
Systems Innovation (Director). (2015, April 18). Graph Theory Overview [Video recording]. https://www.youtube.com/watch?v=82zlRaRUsaY
Systems Innovation (Director). (2015, April 19). Network Connections [Video recording]. https://www.youtube.com/watch?v=2iViaEAytxw