The clustering coefficient is a measure of how likely it is that a node's neighbors are connected to each other.
The degree of a node is how many connections it has.
A graph is a mathematical structure consisting of a set of elements and a set that defines the connections between them.
A path is a sequence of edges connecting two nodes.
A random network is a network generated by one of a few different random processes.
Scale-free networks exhibit a power-law, or "fat-tail," distribution of degrees.
Small-world networks have higher-than-expected clustering coefficients and short mean distances.