Clustering (cliquishness, transitivity) coeff of node
- given a node, what fraction of that nodes neighbors are neighbors of each other
- measured by fraction of links among neighbors / total possible links among neighbors

Clustering coeff avg: avg clustering coeff of each node

Component: maximally connected subgraph

Degree: #links of node

Diameter: max distance btw any two nodes
- infinity if no path btw any two nodes
- often report max dist in largest component

Distance (btw nodes): shortest path length

Pairwise Stability: no one wants to unilaterally delete, and no two want to form additional link

Path: links connecting two nodes a, b with first link contains a and last contains b

Path length: #links involved in path

Preferential Attachment: process is which some quantity (links here) is distributed among nodes based on what already have, i.e. rich get richer.

Small-world network: most nodes not neighbors of one another but can be reached from every other by a small num of hops or steps