Automatic Network Fingerprinting through Single-Node Motifs
arXiv:1102.0099 · doi:10.1371/journal.pone.0015765
Abstract
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs---a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.
16 pages (4 figures) plus supporting information 8 pages (5 figures)
References in corpus (28)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Epidemic spreading in scale-free networks
- Lethality and centrality in protein networks
- Catastrophic cascade of failures in interdependent networks
- The diameter of the world wide web
- Identification of influential spreaders in complex networks
- Evolutionary games on graphs
- Characterization of complex networks: A survey of measurements
- Coevolutionary games - a mini review
- Adaptive Coevolutionary Networks: A Review
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- Mixture models and exploratory analysis in networks
- Simulation of Robustness against Lesions of Cortical Networks
- Evolution of cooperation on scale-free networks subject to error and attack
- Inferring Network Mechanisms: The Drosophila melanogaster Protein Interaction Network
- Traffic-driven Epidemic Spreading in Finite-size Scale-Free Networks
- Criticality of spreading dynamics in hierarchical cluster networks without inhibition
- Hierarchical characterization of complex networks
- Edge vulnerability in neural and metabolic networks
- Predicting the connectivity of primate cortical networks from topological and spatial node properties
- Brain architecture: A design for natural computation
- Inversion method for content-based networks
- Beyond the average: Detecting global singular nodes from local features in complex networks
- Detecting groups of similar components in complex networks