Transforming complex network to the acyclic one
arXiv:1010.1864 · doi:10.1016/j.physa.2012.07.030
Abstract
Acyclic networks are a class of complex networks in which links are directed and don't have closed loops. Here we present an algorithm for transforming an ordinary undirected complex network into an acyclic one. Further analysis of an acyclic network allows finding structural properties of the network. With our approach one can find the communities and key nodes in complex networks. Also we propose a new parameter of complex networks which can mark most vulnerable nodes of the system. The proposed algorithm can be applied to finding communities and bottlenecks in general complex networks.
arXiv comment13 pages, 8 figures
References in corpus (20)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Community detection in graphs
- Finding community structure in very large networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Finding community structure in networks using the eigenvectors of matrices
- Maps of random walks on complex networks reveal community structure
- Functional cartography of complex metabolic networks
- Benchmark graphs for testing community detection algorithms
- Characterization of complex networks: A survey of measurements
- Defining and identifying communities in networks
- Community detection algorithms: a comparative analysis
- An information-theoretic framework for resolving community structure in complex networks
- Finding Communities in Linear Time: A Physics Approach
- Detecting Network Communities: a new systematic and efficient algorithm
- Multiresolution community detection for megascale networks by information-based replica correlations
- Citation Networks in High Energy Physics
- Exploring the Free Energy Landscape: From Dynamics to Networks and Back
- Random graph models for directed acyclic networks
- Random acyclic networks