Incompatibility networks as models of scale-free small-world graphs
AbstractWe make a mapping from Sierpinski fractals to a new class of networks, the incompatibility networks, which are scale-free, small-world, disassortative, and maximal planar graphs. Some relevant characteristics of the networks such as degree distribution, clustering coefficient, average path length, and degree correlations are computed analytically and found to be peculiarly rich. The method of network representation can be applied to some real-life systems making it possible to study the complexity of real networked systems within the framework of complex network theory. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2007
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.
Bibliographic InfoArticle provided by Springer in its journal The European Physical Journal B.
Volume (Year): 60 (2007)
Issue (Month): 2 (November)
Contact details of provider:
Web page: http://www.springer.com/economics/journal/10051
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Knor, Martin & Škrekovski, Riste, 2013. "Deterministic self-similar models of complex networks based on very symmetric graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4629-4637.
- Chen, Renxia & Fu, Xinchu & Wu, Qingchu, 2012. "On topological properties of the octahedral Koch network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 880-886.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.