IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2022i1p92-d1015117.html
   My bibliography  Save this article

On the Degree Distribution of Haros Graphs

Author

Listed:
  • Jorge Calero-Sanz

    (ETSI Aeronáutica y del Espacio (ETSIAE), Universidad Politécnica de Madrid, 28040 Madrid, Spain
    Department of Signal Theory and Communications, Telematics and Computing Systems, Rey Juan Carlos University, 28942 Fuenlabrada, Spain)

Abstract

Haros graphs are a graph-theoretical representation of real numbers in the unit interval. The degree distribution of the Haros graphs provides information regarding the topological structure and the associated real number. This article provides a comprehensive demonstration of a conjecture concerning the analytical formulation of the degree distribution. Specifically, a theorem outlines the relationship between Haros graphs, the corresponding continued fraction of its associated real number, and the subsequent symbolic paths in the Farey binary tree. Moreover, an expression that is continuous and piecewise linear in subintervals defined by Farey fractions can be derived from an additional conclusion for the degree distribution of Haros graphs.

Suggested Citation

  • Jorge Calero-Sanz, 2022. "On the Degree Distribution of Haros Graphs," Mathematics, MDPI, vol. 11(1), pages 1-15, December.
  • Handle: RePEc:gam:jmathe:v:11:y:2022:i:1:p:92-:d:1015117
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/1/92/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/1/92/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bartolo Luque & Lucas Lacasa & Fernando J Ballesteros & Alberto Robledo, 2011. "Feigenbaum Graphs: A Complex Network Perspective of Chaos," PLOS ONE, Public Library of Science, vol. 6(9), pages 1-8, September.
    Full references (including those not matched with items on IDEAS)

    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. Bezsudnov, I.V. & Snarskii, A.A., 2014. "From the time series to the complex networks: The parametric natural visibility graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 414(C), pages 53-60.
    2. Robert G. Sacco, 2019. "The Predictability of Synchronicity Experience: Results from a Survey of Jungian Analysts," International Journal of Psychological Studies, Canadian Center of Science and Education, vol. 11(3), pages 1-46, September.
    3. Nuño, Juan Carlos & Muñoz, Francisco J., 2020. "The partial visibility curve of the Feigenbaum cascade to chaos," Chaos, Solitons & Fractals, Elsevier, vol. 131(C).
    4. de Godoy, Isabelle Bueno Silva & McGrane-Corrigan, Blake & Mason, Oliver & Moral, Rafael de Andrade & Godoy, Wesley Augusto Conde, 2023. "Plant-host shift, spatial persistence, and the viability of an invasive insect population," Ecological Modelling, Elsevier, vol. 475(C).
    5. Wu, Zhenyu & Shang, Pengjian & Xiong, Hui, 2018. "An improvement of the measurement of time series irreversibility with visibility graph approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 370-378.
    6. Davide Provenzano & Rodolfo Baggio, 2021. "Complexity traits and synchrony of cryptocurrencies price dynamics," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 44(2), pages 941-955, December.
    7. Gao, Meng & Ge, Ruijun, 2024. "Mapping time series into signed networks via horizontal visibility graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 633(C).
    8. Nakamura, Tomomichi & Tanizawa, Toshihiro, 2012. "Networks with time structure from time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(20), pages 4704-4710.
    9. Wang, Fan & Tian, Lixin & Du, Ruijin & Dong, Gaogao, 2021. "Universal law in the crude oil market based on visibility graph algorithm and network structure," Resources Policy, Elsevier, vol. 70(C).

    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:gam:jmathe:v:11:y:2022:i:1:p:92-:d:1015117. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.