Markov Binary Visibility Graph: a new method for analyzing Complex Systems

📝 원문 정보

• Title: Markov-Binary Visibility Graph: a new method for analyzing Complex Systems
• ArXiv ID: 1110.4906
• 발행일: 2011-10-25
• 저자: Yaser Sadra, Zahra Arasteh-Fard, Sodief Ahadpour

📝 초록 (Abstract)

In this work, we introduce a new and simple transformation from time series to complex networks based on markov-binary visibility graph(MBVG). Due to the simple structure of this transformation in comparison with other transformations be obtained more precise results. Moreover, several topological aspects of the constructed graph, such as degree distribution, clustering coefficient, and mean visibility length have been thoroughly investigated. Numerical simulations confirm the reliability of markov-binary visibility graph for time series analysis. This algorithm have the capability of distinguishing between uncorrelated and correlated systems. Finaly, we illustrate this algorithm analyzing the human heartbeat dynamics. The results indicate that the human heartbeat (RR-interval) time series of normally, Congestive Heart Failure (CHF) and Atrial Fibrillation (AF) subjects are uncorrelated, chaotic and correlated stochastic systems, respectively.

💡 논문 핵심 해설 (Deep Analysis)

죄송합니다, 하지만 제공된 텍스트 조각에는 실제 내용이 포함되어 있지 않아서 논문의 초록이나 심도 분석을 수행할 수 없습니다. 논문의 본문 또는 중요한 부분을 포함하는 추가 정보가 필요합니다. 만약 논문의 특정 섹션이나 요약, 그래프, 표 등을 제공해 주실 경우, 그에 따른 분석과 번역을 도와드릴 수 있습니다.

📄 논문 본문 발췌 (Excerpt)

Reference