ABSTRACT
This chapter explores an array of network parameters that provide more insights into a network's structure and organisation. It examines how to identify clusters, or communities, in networks, and provides a discussion on motifs. The most elementary property of a node, degree is the number of neighbours a node has in a given network. Degree distribution is the distribution of the node degrees in a graph. The density of a network is defined as the fraction of all possible edges the network contains. Geodesic, or shortest path represents the path with the fewest number of edges between a given pair of vertices, denoted dij. Connected component represents sets of nodes, where every pair of nodes have a path between them. Diameter is the length of the longest geodesic in the graph. Closeness centrality tries to quantify the centrality of a node, based on its proximity to all other nodes in the network.
