Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
31 Cards in this Set
- Front
- Back
|
Degree |
Number of nodes, node is connected to |
|
|
In degree |
Number of nodes, node links to |
|
|
Out degree |
Number of nodes that link to node |
|
|
Degree distribution |
Graphical representation of degrees of nodes in a network |
|
|
Adjacency matrix |
Two dimensional matrix representing links between nodes |
|
|
Hypergraph |
In a hypergraph groups of nodes are connected |
|
|
Bipartite networks |
Nodes divided into x and y, only connections between different sets allowed |
|
|
Data collection |
Surveys, direct observation, archival data |
|
|
Components |
A set of nodes that can all be reached from eachother |
|
|
Network Density |
PC = n(n-1)/2 |
|
|
Geodesic distance |
Length of geodesic path between two nodes |
|
|
Geodesic path |
Shortest route between two nodes |
|
|
Average path length |
Average length between all nodes in a network |
|
|
Diameter |
Longest geodesic in a network |
|
|
Bridge |
Link that, if removed would put nodes in a seperate component |
|
|
Weak ties |
Weak are more important for spreading information. Strong ties have similiar information |
|
|
Triadic closure |
Two people with common friend are more likely to become friends themselves |
|
|
Embededness |
Number of common neighbors shared by a nodes endpoint |
|
|
Honophily |
We know people with similiar interests |
|
|
Social capital |
Benefit gained by position in network |
|
|
Clustering coefficient |
N/d((d-1)/2) where n = number of nodes and d = number of neighbors |
|
|
Degree centrality |
(1/(n-1))d |
|
|
Closeness centrality |
(N-1)/sum if distances |
|
|
Betweeness centrality |
Fraction of shortest that have to go through a node. |
|
|
Diffusion |
Things spreading through a population |
|
|
SI model |
Susceptible/infected. All infected or disease eradicated. Higher degree more infections. Wide connections, disease can spread more |
|
|
Network resilience |
What happens when we remove nodes, edges |
|
|
Cascade |
Chain reaction of nodes being removed |
|
|
Dissasortitivity |
High degree tend to be connected to nodes of low degree, fail in bursts and usually comprehensively |
|
|
Assortative |
Fail quickly but failure is not widespread |
|
|
Nash equilibreum |
Set of choices where no player wants to change their action unilaterally |
