Determining the minimum embedding dimension for state space reconstruction through recurrence networks

K. P. Harikrishnan, R. Jacob, R. Misra, G. Ambika
{"title":"Determining the minimum embedding dimension for state space reconstruction through recurrence networks","authors":"K. P. Harikrishnan, R. Jacob, R. Misra, G. Ambika","doi":"10.29195/iascs.01.01.0004","DOIUrl":null,"url":null,"abstract":"The analysis of observed time series from nonlinear systems is usually done by making a time-delay reconstruction to unfold the dynamics on a multi-dimensional state space. An important aspect of the analysis is the choice of the correct embedding dimension. The conventional procedure used for this is either the method of false nearest neighbors or the saturation of some invariant measure, such as, correlation dimension. Here we examine this issue from a complex network perspective and propose a recurrence network based measure to determine the acceptable minimum embedding dimension to be used for such analysis. The measure proposed here is based on the well known Kullback-Leibler divergence commonly used in information theory. We show that the measure is simple and direct to compute and give accurate result for short time series. To show the significance of the measure in the analysis of practical data, we present the analysis of two EEG signals as examples.","PeriodicalId":298664,"journal":{"name":"arXiv: Neurons and Cognition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Neurons and Cognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29195/iascs.01.01.0004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The analysis of observed time series from nonlinear systems is usually done by making a time-delay reconstruction to unfold the dynamics on a multi-dimensional state space. An important aspect of the analysis is the choice of the correct embedding dimension. The conventional procedure used for this is either the method of false nearest neighbors or the saturation of some invariant measure, such as, correlation dimension. Here we examine this issue from a complex network perspective and propose a recurrence network based measure to determine the acceptable minimum embedding dimension to be used for such analysis. The measure proposed here is based on the well known Kullback-Leibler divergence commonly used in information theory. We show that the measure is simple and direct to compute and give accurate result for short time series. To show the significance of the measure in the analysis of practical data, we present the analysis of two EEG signals as examples.
通过递归网络确定状态空间重构的最小嵌入维数
对非线性系统的观测时间序列的分析通常是通过对其进行时间延迟重构来在多维状态空间上展开动力学。分析的一个重要方面是选择正确的嵌入维数。传统的方法是假最近邻法或一些不变测度的饱和,如相关维数。在这里,我们从复杂网络的角度来研究这个问题,并提出了一个基于递归网络的度量来确定可接受的最小嵌入维数,用于这种分析。这里提出的度量是基于信息论中常用的众所周知的Kullback-Leibler散度。结果表明,该方法计算简单、直接,对短时间序列的测量结果准确。为了说明该方法在实际数据分析中的意义,本文以两个脑电信号为例进行了分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信