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

Feigenbaum Graphs: A Complex Network Perspective of Chaos

Author

Listed:
  • Bartolo Luque
  • Lucas Lacasa
  • Fernando J Ballesteros
  • Alberto Robledo

Abstract

The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a natural graph-theoretical description of nonlinear systems with qualities in the spirit of symbolic dynamics. We support our claim via the case study of the period-doubling and band-splitting attractor cascades that characterize unimodal maps. We provide a universal analytical description of this classic scenario in terms of the horizontal visibility graphs associated with the dynamics within the attractors, that we call Feigenbaum graphs, independent of map nonlinearity or other particulars. We derive exact results for their degree distribution and related quantities, recast them in the context of the renormalization group and find that its fixed points coincide with those of network entropy optimization. Furthermore, we show that the network entropy mimics the Lyapunov exponent of the map independently of its sign, hinting at a Pesin-like relation equally valid out of chaos.

Suggested Citation

  • 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.
    • Handle: RePEc:plo:pone00:0022411
    DOI: 10.1371/journal.pone.0022411
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0022411
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0022411&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0022411?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. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    2. Gutin, Gregory & Mansour, Toufik & Severini, Simone, 2011. "A characterization of horizontal visibility graphs and combinatorics on words," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(12), pages 2421-2428.
    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. Jorge Calero-Sanz, 2022. "On the Degree Distribution of Haros Graphs," Mathematics, MDPI, vol. 11(1), pages 1-15, December.
    2. 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.
    3. 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.
    4. 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).
    5. 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.
    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. 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.
    8. 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).
    9. 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).
    10. 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).

    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. Tang, Jinjun & Wang, Yinhai & Wang, Hua & Zhang, Shen & Liu, Fang, 2014. "Dynamic analysis of traffic time series at different temporal scales: A complex networks approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 303-315.
    2. Emerson, Isaac Arnold & Amala, Arumugam, 2017. "Protein contact maps: A binary depiction of protein 3D structures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 782-791.
    3. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    4. Igor Belykh & Mateusz Bocian & Alan R. Champneys & Kevin Daley & Russell Jeter & John H. G. Macdonald & Allan McRobie, 2021. "Emergence of the London Millennium Bridge instability without synchronisation," Nature Communications, Nature, vol. 12(1), pages 1-14, December.
    5. Berahmand, Kamal & Bouyer, Asgarali & Samadi, Negin, 2018. "A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 41-54.
    6. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    7. Soh, Harold & Lim, Sonja & Zhang, Tianyou & Fu, Xiuju & Lee, Gary Kee Khoon & Hung, Terence Gih Guang & Di, Pan & Prakasam, Silvester & Wong, Limsoon, 2010. "Weighted complex network analysis of travel routes on the Singapore public transportation system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(24), pages 5852-5863.
    8. Wang, Qingyun & Duan, Zhisheng & Chen, Guanrong & Feng, Zhaosheng, 2008. "Synchronization in a class of weighted complex networks with coupling delays," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(22), pages 5616-5622.
    9. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    10. Wu, Tianyu & Huang, Xia & Chen, Xiangyong & Wang, Jing, 2020. "Sampled-data H∞ exponential synchronization for delayed semi-Markov jump CDNs: A looped-functional approach," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    11. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    12. Zhu, Mixin & Zhou, Xiaojun, 2023. "Hybrid opportunistic maintenance policy for serial-parallel multi-station manufacturing systems with spare part overlap," Reliability Engineering and System Safety, Elsevier, vol. 236(C).
    13. Ye, Dan & Yang, Xiang & Su, Lei, 2017. "Fault-tolerant synchronization control for complex dynamical networks with semi-Markov jump topology," Applied Mathematics and Computation, Elsevier, vol. 312(C), pages 36-48.
    14. Dragicevic, Arnaud Z. & Sinclair-Desgagné, Bernard, 2013. "Sustainable network dynamics," Ecological Modelling, Elsevier, vol. 270(C), pages 43-53.
    15. Luo, Mengzhuo & Liu, Xinzhi & Zhong, Shouming & Cheng, Jun, 2018. "Synchronization of multi-stochastic-link complex networks via aperiodically intermittent control with two different switched periods," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 509(C), pages 20-38.
    16. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    17. Yao, Jialing & Sun, Bingbin & Xi, lifeng, 2019. "Fractality of evolving self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 211-216.
    18. Sanghoon Lee & Wonjoon Kim, 2017. "The knowledge network dynamics in a mobile ecosystem: a patent citation analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 111(2), pages 717-742, May.
    19. Jihui Han & Wei Li & Longfeng Zhao & Zhu Su & Yijiang Zou & Weibing Deng, 2017. "Community detection in dynamic networks via adaptive label propagation," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-16, November.
    20. Wang, Xinhe & Lu, Junwei & Wang, Zhen & Li, Yuxia, 2020. "Dynamics of discrete epidemic models on heterogeneous networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).

    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:0022411. 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.