Transforming a complex network to an acyclic one

Roman Shevchuk and Andrew Snarskii

Physica A: Statistical Mechanics and its Applications, 2012, vol. 391, issue 23, 6184-6189

Abstract: Acyclic 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.

Keywords: Acyclic network; Clusterization; Erdős–Rényi; Watts–Strogatz; Vulnerability (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437112006966
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:391:y:2012:i:23:p:6184-6189

DOI: 10.1016/j.physa.2012.07.030

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().