Structure:
nodes, edges
degree (node): number of edges attached to a node;
degree (network): average degree of all nodes
path length: Flights Needed, Social Distance, Likelihood of information spreading
contentedness: A graph is connected if you can get from any node to any other.
Markov Process, Terrorist Group Capabilities, Internet/Power Failure, Information Isolation
clustering coefficient: percentage of triples of nodes that have edges between all three nodes
Redundancy/Robustness, Reinforce (new words/styles), Social Capital, Innovation adoption (triangles)
Logic: How it forms
Structure: measures
Density of connections, Social Capital, Speed of Diffusion
Function: what it does
2013-11-31 (120min) Coursera open course: Model Thinking by Scott E. Page Start from 10.07.2013, will end on 12.16.2013 Link: https://class.coursera.org/modelthinking-005/class/index;
Structure: nodes, edges degree (node): number of edges attached to a node; degree (network): average degree of all nodes path length: Flights Needed, Social Distance, Likelihood of information spreading contentedness: A graph is connected if you can get from any node to any other.
Markov Process, Terrorist Group Capabilities, Internet/Power Failure, Information Isolation clustering coefficient: percentage of triples of nodes that have edges between all three nodes Redundancy/Robustness, Reinforce (new words/styles), Social Capital, Innovation adoption (triangles) Logic: How it forms Structure: measures Density of connections, Social Capital, Speed of Diffusion Function: what it does