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

From the time series to the complex networks: The parametric natural visibility graph

Author

Listed:
  • Bezsudnov, I.V.
  • Snarskii, A.A.

Abstract

We present the modification of natural visibility graph (NVG) algorithm used for the mapping of the time series to the complex networks (graphs). We propose the parametric natural visibility graph (PNVG) algorithm. The PNVG consists of NVG links, which satisfy an additional constraint determined by a newly introduced continuous parameter—the view angle. The alteration of view angle modifies the PNVG and its properties such as the average node degree, average link length of the graph as well as cluster quantity of built graph, etc. We calculated and analyzed different PNVG properties depending on the view angle for different types of the time series such as the random (uncorrelated, correlated and fractal) and cardiac rhythm time series for healthy and ill patients. Investigation of different PNVG properties shows that the view angle gives a new approach to characterize the structure of the time series that are invisible in the conventional version of the algorithm. It is also shown that the PNVG approach allows us to distinguish, identify and describe in detail various time series.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:414:y:2014:i:c:p:53-60
    DOI: 10.1016/j.physa.2014.07.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437114005676
    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.2014.07.002?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. Dorogovtsev, S.N. & Mendes, J.F.F., 2003. "Evolution of Networks: From Biological Nets to the Internet and WWW," OUP Catalogue, Oxford University Press, number 9780198515906.
    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.
    3. Liu, Chuang & Zhou, Wei-Xing & Yuan, Wei-Kang, 2010. "Statistical properties of visibility graph of energy dissipation rates in three-dimensional fully developed turbulence," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(13), pages 2675-2681.
    4. 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)

    Citations

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


    Cited by:

    1. Peng, Xiaoyi & Zhao, Yi & Small, Michael, 2020. "Identification and prediction of bifurcation tipping points using complex networks based on quasi-isometric mapping," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 560(C).
    2. Khondekar, Mofazzal Hossain & Ghosh, Koushik & Bhattacharjee, Anup Kumar, 2016. "Scaling and nonlinear behaviour of daily mean temperature time series across IndiaAuthor-Name: Ray, Rajdeep," Chaos, Solitons & Fractals, Elsevier, vol. 84(C), pages 9-14.
    3. Liu, Hao-Ran & Li, Ming-Xia & Zhou, Wei-Xing, 2024. "Visibility graph analysis of the grains and oilseeds indices," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 650(C).
    4. Xu, Hua & Wang, Minggang & Jiang, Shumin & Yang, Weiguo, 2020. "Carbon price forecasting with complex network and extreme learning machine," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    5. Hu, Xiaohua & Niu, Min, 2023. "Horizontal visibility graphs mapped from multifractal trinomial measures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    6. Li, Sange & Shang, Pengjian, 2021. "Analysis of nonlinear time series using discrete generalized past entropy based on amplitude difference distribution of horizontal visibility graph," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    7. Shang, Binbin & Shang, Pengjian, 2022. "Effective instability quantification for multivariate complex time series using reverse Shannon-Fisher index," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    8. Wang, Minggang & Hua, Chenyu & Zhu, Mengrui & Xie, Shangshan & Xu, Hua & Vilela, André L.M. & Tian, Lixin, 2022. "Interrelation measurement based on the multi-layer limited penetrable horizontal visibility graph," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    9. Dai, Peng-Fei & Xiong, Xiong & Zhou, Wei-Xing, 2019. "Visibility graph analysis of economy policy uncertainty indices," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 531(C).
    10. Bai, Shiwei & Niu, Min & Wang, Yu, 2024. "The network structure of Sturmian sequences based on HVG," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 634(C).
    11. Shengli, Liu & Yongtu, Liang, 2019. "Exploring the temporal structure of time series data for hazardous liquid pipeline incidents based on complex network theory," International Journal of Critical Infrastructure Protection, Elsevier, vol. 26(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. O’Pella, Justin, 2019. "Horizontal visibility graphs are uniquely determined by their directed degree sequence," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    2. 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.
    3. 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.
    4. Chen, Shiyu & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "A visibility graph averaging aggregation operator," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 1-12.
    5. Yonghong Jin & Qi Zhang & Lifei Shan & Sai-Ping Li, 2015. "Characteristics of Venture Capital Network and Its Correlation with Regional Economy: Evidence from China," PLOS ONE, Public Library of Science, vol. 10(9), pages 1-20, September.
    6. Jorge Calero-Sanz, 2022. "On the Degree Distribution of Haros Graphs," Mathematics, MDPI, vol. 11(1), pages 1-15, December.
    7. Ya-Chun Gao & Zong-Wen Wei & Bing-Hong Wang, 2013. "Dynamic Evolution Of Financial Network And Its Relation To Economic Crises," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 1-10.
    8. 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.
    9. Ahmadlou, Mehran & Adeli, Hojjat & Adeli, Amir, 2012. "Improved visibility graph fractality with application for the diagnosis of Autism Spectrum Disorder," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(20), pages 4720-4726.
    10. Mark S. Handcock & Adrian E. Raftery & Jeremy M. Tantrum, 2007. "Model‐based clustering for social networks," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 170(2), pages 301-354, March.
    11. 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.
    12. F. W. S. Lima, 2015. "Evolution of egoism on semi-directed and undirected Barabási-Albert networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 26(12), pages 1-9.
    13. G. Ghoshal & M. E.J. Newman, 2007. "Growing distributed networks with arbitrary degree distributions," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 58(2), pages 175-184, July.
    14. Chang, Y.F. & Han, S.K. & Wang, X.D., 2018. "The way to uncover community structure with core and diversity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 111-119.
    15. Chakrabarti, Anindya S., 2015. "Stochastic Lotka-Volterra equations: A model of lagged diffusion of technology in an interconnected world," IIMA Working Papers WP2015-08-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. 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.
    17. Schmidt, Jonas & Köhne, Daniel, 2023. "A simple scalable linear time algorithm for horizontal visibility graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 616(C).
    18. Roth, Camille, 2007. "Empiricism for descriptive social network models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(1), pages 53-58.
    19. Dong-Rui Chen & Chuang Liu & Yi-Cheng Zhang & Zi-Ke Zhang, 2019. "Predicting Financial Extremes Based on Weighted Visual Graph of Major Stock Indices," Complexity, Hindawi, vol. 2019, pages 1-17, October.
    20. Douglas R. White & Jason Owen-Smith & James Moody & Walter W. Powell, 2004. "Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings," Computational and Mathematical Organization Theory, Springer, vol. 10(1), pages 95-117, May.

    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:414:y:2014:i:c:p:53-60. 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.