The Topology of Technology Graphs: Small World Patterns in Electronic Circuits
AbstractRecent theoretical studies and extensive data analyses have revealed a common feature displayed by biological, social and technological networks: the presence of small world patterns. Here we analyse this problem by using several graphs obtained from one of the most common technological systems: electronic circuits. It is shown that both analogic and digital circuits exhibit SW behavior. We conjecture that the SW pattern arises from the compact design in which many elements share a small, close physical neighborhood plus the fact that the system must define a single connected component (which requires shortcuts connecting different integrated clusters). The degree distributions displayed are consistent with a conjecture concerning the sharp cutoffs associated to the presence of costly connections [Amaral et al., Proc. Natl. Acad. Sci. USA 97 , 11149 (2000)] thus providing a limit case for the classes of universality of small world patterns from real, artificial networks. The consequences for circuit design are outlined.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by Santa Fe Institute in its series Working Papers with number 01-05-029.
Date of creation: May 2001
Date of revision:
Contact details of provider:
Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
Small world; electronic devices; networks; graph theory; evolvable hardware; statistical physics;
This paper has been announced in the following NEP Reports:
- NEP-ENT-2001-07-17 (Entrepreneurship)
- NEP-EVO-2001-07-17 (Evolutionary Economics)
- NEP-NET-2001-07-17 (Network Economics)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Miralles, Alicia & Comellas, Francesc & Chen, Lichao & Zhang, Zhongzhi, 2010. "Planar unclustered scale-free graphs as models for technological and biological networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(9), pages 1955-1964.
- Comellas, Francesc & Miralles, Alicia, 2009. "Modeling complex networks with self-similar outerplanar unclustered graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(11), pages 2227-2233.
- Cárdenas, J.P. & Mouronte, M.L. & Moyano, L.G. & Vargas, M.L. & Benito, R.M., 2010. "On the robustness of Spanish telecommunication networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(19), pages 4209-4216.
- Comellas, Francesc & Miralles, Alícia & Liu, Hongxiao & Zhang, Zhongzhi, 2013. "The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(12), pages 2803-2806.
- Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
- Cárdenas, J.P. & Mouronte, M.L. & Benito, R.M. & Losada, J.C., 2010. "Compatibility as underlying mechanism behind the evolution of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(8), pages 1789-1798.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
If references are entirely missing, you can add them using this form.