Transforming a complex network to an acyclic one
AbstractAcyclic networks are a class of complex networks in which links are directed and do not 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 one to find the 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 the most vulnerable nodes of the system. The proposed algorithm can be applied to finding communities and bottlenecks in general complex networks.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Physica A: Statistical Mechanics and its Applications.
Volume (Year): 391 (2012)
Issue (Month): 23 ()
Contact details of provider:
Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/
Acyclic network; Clusterization; Erdős–Rényi; Watts–Strogatz; Vulnerability;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.