Incompatibility networks as models of scale-free small-world graphs
We 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
Volume (Year): 60 (2007)
Issue (Month): 2 (November)
|Contact details of provider:|| Web page: http://www.springer.com/economics/journal/10051|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:60:y:2007:i:2:p:259-264. See general 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.