IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v389y2010i9p1955-1964.html

Planar unclustered scale-free graphs as models for technological and biological networks

Author

Listed:
  • Miralles, Alicia
  • Comellas, Francesc
  • Chen, Lichao
  • Zhang, Zhongzhi

Abstract

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases — usually associated with topological restrictions — their clustering is low and they are almost planar. In this paper we introduce a family of graphs which share all these properties and are defined by two parameters. As their construction is deterministic, we obtain exact analytic expressions for relevant properties of the graphs including the degree distribution, degree correlation, diameter, and average distance, as a function of the two defining parameters. Thus, the graphs are useful to model some complex networks, in particular several families of technological and biological networks, and in the design of new practical communication algorithms in relation to their dynamical processes. They can also help understanding the underlying mechanisms that have produced their particular structure.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:389:y:2010:i:9:p:1955-1964
    DOI: 10.1016/j.physa.2009.12.056
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843710901070X
    Download Restriction: 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
    File URL: https://libkey.io/10.1016/j.physa.2009.12.056?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Zhang, Zhongzhi & Rong, Lili & Comellas, Francesc, 2006. "High-dimensional random Apollonian networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 610-618.
    2. Ramon Ferrer i Cancho & Christiaan Janssen & Ricard V. Solé, 2001. "The Topology of Technology Graphs: Small World Patterns in Electronic Circuits," Working Papers 01-05-029, Santa Fe Institute.
    3. Chaoming Song & Shlomo Havlin & Hernán A. Makse, 2005. "Self-similarity of complex networks," Nature, Nature, vol. 433(7024), pages 392-395, January.
    4. Aaron Clauset & Cristopher Moore & M. E. J. Newman, 2008. "Hierarchical structure and the prediction of missing links in networks," Nature, Nature, vol. 453(7191), pages 98-101, May.
    5. 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.
    6. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lv, Yuqian & Zhou, Bo & Wang, Jinhuan & Xuan, Qi, 2024. "Targeted k-node collapse problem: Towards understanding the robustness of local k-core structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 641(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Ikeda, Nobutoshi, 2019. "Growth model for fractal scale-free networks generated by a random walk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 424-434.
    3. Baggio, Rodolfo, 2020. "Tourism destinations: A universality conjecture based on network science," Annals of Tourism Research, Elsevier, vol. 82(C).
    4. Zhang, Xiaohui & Luo, Xudong & Ma, Fei, 2026. "Random walks and consensus problem on tree network with an identical degree distribution," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 681(C).
    5. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    6. Sun, Bingbin & Yao, Jialing & Xi, Lifeng, 2019. "Eigentime identities of fractal sailboat networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 338-349.
    7. 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.
    8. Lucas Cuadra & Sancho Salcedo-Sanz & Javier Del Ser & Silvia Jiménez-Fernández & Zong Woo Geem, 2015. "A Critical Review of Robustness in Power Grids Using Complex Networks Concepts," Energies, MDPI, vol. 8(9), pages 1-55, August.
    9. Liu, Yang & Ouyang, Jinzhi & Zhao, Ronghui & Shi, Haobin & Pan, Wei & Ma, Fei, 2025. "Structural transition on partial edge-based growing graph," Chaos, Solitons & Fractals, Elsevier, vol. 201(P2).
    10. 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.
    11. 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.
    12. Luca De Benedictis & Silvia Leoni, 2020. "Gender bias in the Erasmus students network," Papers 2003.09167, arXiv.org.
    13. Guo, Fangjian & Yang, Zimo & Zhou, Tao, 2013. "Predicting link directions via a recursive subgraph-based ranking," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(16), pages 3402-3408.
    14. Zhang Zhang & Arsham Ghavasieh & Jiang Zhang & Manlio Domenico, 2025. "Coarse-graining network flow through statistical physics and machine learning," Nature Communications, Nature, vol. 16(1), pages 1-11, December.
    15. Li, Ziyu & Yao, Jialing & Wang, Qin, 2019. "Fractality of multiple colored substitution networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 402-408.
    16. Wang, Dan & Zhou, Xiao & Zhao, Pengwei & Pang, Juan & Ren, Qiaoyang, 2025. "Early identification of breakthrough technologies: Insights from science-driven innovations," Journal of Informetrics, Elsevier, vol. 19(1).
    17. Zhang, Ruixia & Li, Deyu, 2017. "Rumor propagation on networks with community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 483(C), pages 375-385.
    18. Wu, Zhenxing & Lu, Xi & Deng, Yong, 2015. "Image edge detection based on local dimension: A complex networks approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 440(C), pages 9-18.
    19. Xie, Wen-Jie & Zhou, Wei-Xing, 2011. "Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus the Hurst index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3592-3601.
    20. Liang, Wei & Shi, Yuming & Huang, Qiuling, 2014. "Modeling the Chinese language as an evolving network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 268-276.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:389:y:2010:i:9:p:1955-1964. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.