Systematic identification of statistically significant network measures

Abstract

We present a novel graph embedding space (i.e., a set of measures on graphs) for performing statistical analyses of networks. Key improvements over existing approaches include discovery of "motif-hubs" (multiple overlapping significant subgraphs), computational efficiency relative to subgraph census, and flexibility (the method is easily generalizable to weighted and signed graphs). The embedding space is based on {\it scalars}, functionals of the adjacency matrix representing the network. {\it Scalars} are global, involving all nodes; although they can be related to subgraph enumeration, there is not a one-to-one mapping between scalars and subgraphs. Improvements in network randomization and significance testing--we learn the distribution rather than assuming gaussianity--are also presented. The resulting algorithm establishes a systematic approach to the identification of the most significant scalars and suggests machine-learning techniques for network classification.

19 pages, 12 figures

References in corpus (6)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Specificity and stability in topology of protein networks
• The information bottleneck method
• Connectivity of Growing Random Networks

Cited by in corpus (8)

• Characterization of complex networks: A survey of measurements
• Inferring Network Mechanisms: The Drosophila melanogaster Protein Interaction Network
• An Information-Theoretic Approach to Network Modularity
• Scaling and precursor motifs in earthquake networks
• Subgraph Ensembles and Motif Discovery Using a New Heuristic for Graph Isomorphism
• Non-parametric resampling of random walks for spectral network clustering
• Impact of observational incompleteness on the structural properties of protein interaction networks
• Social insect colony as a biological regulatory system: Information flow in dominance networks