Methods for Analyzing Networks

This chapter starts with the basic topic of network representation with graphs and matrices. Then it introduces fundamental methods for analyzing nodes, such as centrality, power and prestige. It describes structural, regular and automorphic equivalence for analyzing dyadic pairs, and cliques for examining subgroup partitions. It concludes with discussions on measures of whole network, such as density and centralization.