IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0056461.html
   My bibliography  Save this article

Structural Properties and Complexity of a New Network Class: Collatz Step Graphs

Author

Listed:
  • Frank Emmert-Streib

Abstract

In this paper, we introduce a biologically inspired model to generate complex networks. In contrast to many other construction procedures for growing networks introduced so far, our method generates networks from one-dimensional symbol sequences that are related to the so called Collatz problem from number theory. The major purpose of the present paper is, first, to derive a symbol sequence from the Collatz problem, we call the step sequence, and investigate its structural properties. Second, we introduce a construction procedure for growing networks that is based on these step sequences. Third, we investigate the structural properties of this new network class including their finite scaling and asymptotic behavior of their complexity, average shortest path lengths and clustering coefficients. Interestingly, in contrast to many other network models including the small-world network from Watts & Strogatz, we find that CS graphs become ‘smaller’ with an increasing size.

Suggested Citation

  • Frank Emmert-Streib, 2013. "Structural Properties and Complexity of a New Network Class: Collatz Step Graphs," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-14, February.
    • Handle: RePEc:plo:pone00:0056461
    DOI: 10.1371/journal.pone.0056461
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0056461
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0056461&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0056461?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
    ---><---

    References listed on IDEAS

    as
    1. Chandra, Anjan Kumar & Dasgupta, Subinay, 2005. "A small world network of prime numbers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 357(3), pages 436-446.
    2. Frank Emmert-Streib, 2011. "Parametric Construction of Episode Networks from Pseudoperiodic Time Series Based on Mutual Information," PLOS ONE, Public Library of Science, vol. 6(12), pages 1-12, December.
    3. Stanley, H.E. & Buldyrev, S.V. & Goldberger, A.L. & Goldberger, Z.D. & Havlin, S. & Mantegna, R.N. & Ossadnik, S.M. & Peng, C.-K. & Simons, M., 1994. "Statistical mechanics in biology: how ubiquitous are long-range correlations?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 205(1), pages 214-253.
    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. Mark D Humphries & Kevin Gurney, 2008. "Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence," PLOS ONE, Public Library of Science, vol. 3(4), pages 1-10, April.
    6. Kim, Jongkwang & Wilhelm, Thomas, 2008. "What is a complex graph?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(11), pages 2637-2652.
    7. Frank Emmert-Streib & Matthias Dehmer, 2010. "Influence of the Time Scale on the Construction of Financial Networks," PLOS ONE, Public Library of Science, vol. 5(9), pages 1-9, September.
    8. Claussen, Jens Christian, 2007. "Offdiagonal complexity: A computationally quick complexity measure for graphs and networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 375(1), pages 365-373.
    9. Ebeling, Werner & Neiman, Alexander, 1995. "Long-range correlations between letters and sentences in texts," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 215(3), pages 233-241.
    10. Frank Emmert-Streib, 2010. "Statistic Complexity: Combining Kolmogorov Complexity with an Ensemble Approach," PLOS ONE, Public Library of Science, vol. 5(8), pages 1-6, August.
    11. Marcus Kaiser & Claus C Hilgetag, 2006. "Nonoptimal Component Placement, but Short Processing Paths, due to Long-Distance Projections in Neural Systems," PLOS Computational Biology, Public Library of Science, vol. 2(7), pages 1-11, July.
    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. José A. Tenreiro Machado & Alexandra Galhano & Daniel Cao Labora, 2021. "A Clustering Perspective of the Collatz Conjecture," Mathematics, MDPI, vol. 9(4), pages 1-14, February.

    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. Tuğal, İhsan & Karcı, Ali, 2019. "Comparisons of Karcı and Shannon entropies and their effects on centrality of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 352-363.
    3. Lavanya Sivakumar & Matthias Dehmer, 2012. "Towards Information Inequalities for Generalized Graph Entropies," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-14, June.
    4. Zenil, Hector & Soler-Toscano, Fernando & Dingle, Kamaludin & Louis, Ard A., 2014. "Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 341-358.
    5. David Samu & Anil K Seth & Thomas Nowotny, 2014. "Influence of Wiring Cost on the Large-Scale Architecture of Human Cortical Connectivity," PLOS Computational Biology, Public Library of Science, vol. 10(4), pages 1-24, April.
    6. Riccardo Muolo & Joseph D. O’Brien & Timoteo Carletti & Malbor Asllani, 2024. "Persistence of chimera states and the challenge for synchronization in real-world networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 97(1), pages 1-16, January.
    7. Türker, İlker, 2018. "Generating clustered scale-free networks using Poisson based localization of edges," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 72-85.
    8. Jin Wang & Bo Huang & Xuefeng Xia & Zhirong Sun, 2006. "Funneled Landscape Leads to Robustness of Cell Networks: Yeast Cell Cycle," PLOS Computational Biology, Public Library of Science, vol. 2(11), pages 1-10, November.
    9. Zhou, Wei-Xing & Jiang, Zhi-Qiang & Sornette, Didier, 2007. "Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 375(2), pages 741-752.
    10. Jorge Peña & Yannick Rochat, 2012. "Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-13, September.
    11. Sgrignoli, P. & Agliari, E. & Burioni, R. & Schianchi, A., 2015. "Instability and network effects in innovative markets," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 108(C), pages 260-271.
    12. Long Ma & Xiao Han & Zhesi Shen & Wen-Xu Wang & Zengru Di, 2015. "Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-12, November.
    13. Christian F A Negre & Hayato Ushijima-Mwesigwa & Susan M Mniszewski, 2020. "Detecting multiple communities using quantum annealing on the D-Wave system," PLOS ONE, Public Library of Science, vol. 15(2), pages 1-14, February.
    14. Andrea Avena-Koenigsberger & Xiaoran Yan & Artemy Kolchinsky & Martijn P van den Heuvel & Patric Hagmann & Olaf Sporns, 2019. "A spectrum of routing strategies for brain networks," PLOS Computational Biology, Public Library of Science, vol. 15(3), pages 1-24, March.
    15. Alvarez-Ramirez, Jose & Espinosa-Paredes, Gilberto & Vazquez, Alejandro, 2005. "Detrended fluctuation analysis of the neutronic power from a nuclear reactor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 351(2), pages 227-240.
    16. Corrêa, Edilson A. & Marinho, Vanessa Q. & Amancio, Diego R., 2020. "Semantic flow in language networks discriminates texts by genre and publication date," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    17. Biggiero, Lucio & Angelini, Pier Paolo, 2015. "Hunting scale-free properties in R&D collaboration networks: Self-organization, power-law and policy issues in the European aerospace research area," Technological Forecasting and Social Change, Elsevier, vol. 94(C), pages 21-43.
    18. Tamás Nepusz & Tamás Vicsek, 2013. "Hierarchical Self-Organization of Non-Cooperating Individuals," PLOS ONE, Public Library of Science, vol. 8(12), pages 1-9, December.
    19. Aslam, Faheem & Aziz, Saqib & Nguyen, Duc Khuong & Mughal, Khurrum S. & Khan, Maaz, 2020. "On the efficiency of foreign exchange markets in times of the COVID-19 pandemic," Technological Forecasting and Social Change, Elsevier, vol. 161(C).
    20. repec:plo:pone00:0226025 is not listed on IDEAS
    21. Mark D Humphries & Javier A Caballero & Mat Evans & Silvia Maggi & Abhinav Singh, 2021. "Spectral estimation for detecting low-dimensional structure in networks using arbitrary null models," PLOS ONE, Public Library of Science, vol. 16(7), pages 1-22, July.

    More about this item

    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:plo:pone00:0056461. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.