IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v364y2006icp610-618.html
   My bibliography  Save this article

High-dimensional random Apollonian networks

Author

Listed:
  • Zhang, Zhongzhi
  • Rong, Lili
  • Comellas, Francesc

Abstract

We propose a simple algorithm which produces a new category of networks, high-dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and clustering coefficients which are determined by the dimension of the network. The values obtained for these parameters are in good agreement with simulation results and comparable to those coming from real networks. We estimate also analytically that the average path length of the networks increases at most logarithmically with the number of vertices.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:phsmap:v:364:y:2006:i:c:p:610-618
    DOI: 10.1016/j.physa.2005.09.042
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437105010150
    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.2005.09.042?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Comellas, Francesc & Sampels, Michael, 2002. "Deterministic small-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 309(1), pages 231-235.
    2. 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.
    3. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    4. H. Jeong & B. Tombor & R. Albert & Z. N. Oltvai & A.-L. Barabási, 2000. "The large-scale organization of metabolic networks," Nature, Nature, vol. 407(6804), pages 651-654, October.
    5. Barabási, Albert-László & Ravasz, Erzsébet & Vicsek, Tamás, 2001. "Deterministic scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 299(3), pages 559-564.
    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. Wang, Xiaomin & Yao, Bing, 2020. "Two cumulative distributions for scale-freeness of dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 556(C).
    2. 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.
    3. Hiro Ito, 2019. "What Graph Properties Are Constant-Time Testable?," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 101-121, October.
    4. Prettejohn, Brenton J. & Berryman, Matthew J. & McDonnell, Mark D., 2013. "A model of the effects of authority on consensus formation in adaptive networks: Impact on network topology and robustness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(4), pages 857-868.
    5. 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.

    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. 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.
    2. Chen, Qinghua & Shi, Dinghua, 2004. "The modeling of scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 335(1), pages 240-248.
    3. Rendón de la Torre, Stephanie & Kalda, Jaan & Kitt, Robert & Engelbrecht, Jüri, 2016. "On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estonia," Chaos, Solitons & Fractals, Elsevier, vol. 90(C), pages 18-27.
    4. Zheng, Xiaolong & Zeng, Daniel & Li, Huiqian & Wang, Feiyue, 2008. "Analyzing open-source software systems as complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6190-6200.
    5. Roland Pongou & Guy Tchuente & Jean-Baptiste Tondji, 2021. "Optimally Targeting Interventions in Networks during a Pandemic: Theory and Evidence from the Networks of Nursing Homes in the United States," Papers 2110.10230, arXiv.org.
    6. Pongou, Roland & Tchuente, Guy & Tondji, Jean-Baptiste, 2021. "Optimally Targeting Interventions in Networks during a Pandemic: Theory and Evidence from the Networks of Nursing Homes in the United States," GLO Discussion Paper Series 957, Global Labor Organization (GLO).
    7. Guillaume, Jean-Loup & Latapy, Matthieu, 2006. "Bipartite graphs as models of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 795-813.
    8. Heath Henderson & Arnob Alam, 2022. "The structure of risk-sharing networks," Empirical Economics, Springer, vol. 62(2), pages 853-886, February.
    9. Kazemilari, Mansooreh & Mardani, Abbas & Streimikiene, Dalia & Zavadskas, Edmundas Kazimieras, 2017. "An overview of renewable energy companies in stock exchange: Evidence from minimal spanning tree approach," Renewable Energy, Elsevier, vol. 102(PA), pages 107-117.
    10. Chen, Qinghua & Shi, Dinghua, 2006. "Markov chains theory for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 360(1), pages 121-133.
    11. Yao, Xin & Zhang, Chang-shui & Chen, Jin-wen & Li, Yan-da, 2005. "On the formation of degree and cluster-degree correlations in scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 353(C), pages 661-673.
    12. Zhu, Hailin & Luo, Hong & Peng, Haipeng & Li, Lixiang & Luo, Qun, 2009. "Complex networks-based energy-efficient evolution model for wireless sensor networks," Chaos, Solitons & Fractals, Elsevier, vol. 41(4), pages 1828-1835.
    13. 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.
    14. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    15. J. Esquivel-Gómez & R. E. Balderas-Navarro & P. D. Arjona-Villicaña & P. Castillo-Castillo & O. Rico-Trejo & J. Acosta-Elias, 2017. "On the Emergence of Islands in Complex Networks," Complexity, Hindawi, vol. 2017, pages 1-10, January.
    16. P.B., Divya & Lekha, Divya Sindhu & Johnson, T.P. & Balakrishnan, Kannan, 2022. "Vulnerability of link-weighted complex networks in central attacks and fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    17. Wang, Junjie & Zhou, Shuigeng & Guan, Jihong, 2011. "Characteristics of real futures trading networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(2), pages 398-409.
    18. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    19. Fu, Jingcheng & Wu, Jianliang & Liu, Chuanjian & Xu, Jin, 2016. "Leaders in communities of real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 428-441.
    20. Salcedo-Sanz, S. & Cuadra, L., 2019. "Quasi scale-free geographically embedded networks over DLA-generated aggregates," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1286-1305.

    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:364:y:2006:i:c:p:610-618. 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.