Complex network-based multistep forecasting model for hyperchaotic time series.

IF 2.4 3区 物理与天体物理 Q2 PHYSICS, FLUIDS & PLASMAS Physical Review E Pub Date : 2024-10-01 DOI:10.1103/PhysRevE.110.044302
Reshmi L B, Drisya Alex Thumba, K Asokan, T K Manoj Kumar, T R Ramamohan, K Satheesh Kumar
{"title":"Complex network-based multistep forecasting model for hyperchaotic time series.","authors":"Reshmi L B, Drisya Alex Thumba, K Asokan, T K Manoj Kumar, T R Ramamohan, K Satheesh Kumar","doi":"10.1103/PhysRevE.110.044302","DOIUrl":null,"url":null,"abstract":"<p><p>We present a method for predicting hyperchaotic time series using a complex network-based forecasting model. We first construct a network from a given time series, which serves as a coarse-grained representation of the underlying attractor. This network facilitates multistep forecasting by capturing the local nonlinearity of the dynamics and offers superior accuracy over more extended periods than traditional methods. The network is formed by converting the patterns of local oscillations into sequences of numerical symbols, which are then used to create nodes and edges in a network, capturing the system's dynamical behavior at a reduced resolution. The network allows predictions up to several steps ahead without the exponential error increase usually associated with linear first-order methods. The improved predictions result from the unique ability of the network to collect identical pattern transitions in the orbit dynamics into a system of neighborhoods in the network. The effectiveness of this approach is demonstrated through its application to several high-dimensional hyperchaotic systems, where it outperforms both the linear first-order and other network-based methods in terms of prediction accuracy and horizon. Besides enhancing the predictability of chaotic systems, this methodology also outlines a procedure to develop a discrete model flow within an attractor.</p>","PeriodicalId":48698,"journal":{"name":"Physical Review E","volume":"110 4-1","pages":"044302"},"PeriodicalIF":2.4000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical Review E","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1103/PhysRevE.110.044302","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, FLUIDS & PLASMAS","Score":null,"Total":0}
引用次数: 0

Abstract

We present a method for predicting hyperchaotic time series using a complex network-based forecasting model. We first construct a network from a given time series, which serves as a coarse-grained representation of the underlying attractor. This network facilitates multistep forecasting by capturing the local nonlinearity of the dynamics and offers superior accuracy over more extended periods than traditional methods. The network is formed by converting the patterns of local oscillations into sequences of numerical symbols, which are then used to create nodes and edges in a network, capturing the system's dynamical behavior at a reduced resolution. The network allows predictions up to several steps ahead without the exponential error increase usually associated with linear first-order methods. The improved predictions result from the unique ability of the network to collect identical pattern transitions in the orbit dynamics into a system of neighborhoods in the network. The effectiveness of this approach is demonstrated through its application to several high-dimensional hyperchaotic systems, where it outperforms both the linear first-order and other network-based methods in terms of prediction accuracy and horizon. Besides enhancing the predictability of chaotic systems, this methodology also outlines a procedure to develop a discrete model flow within an attractor.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于复杂网络的超混沌时间序列多步骤预测模型。
我们提出了一种利用基于复杂网络的预测模型预测超混沌时间序列的方法。我们首先根据给定的时间序列构建一个网络,作为底层吸引子的粗粒度表示。该网络通过捕捉动态的局部非线性来促进多步骤预测,并在更长的时间段内提供比传统方法更高的精度。该网络是通过将局部振荡模式转换为数字符号序列而形成的,然后用数字符号序列创建网络中的节点和边,以较低的分辨率捕捉系统的动态行为。该网络可以提前几步进行预测,而不会出现线性一阶方法通常会出现的指数误差。预测结果的改进源于网络的独特能力,它能将轨道动力学中的相同模式转换收集到网络中的邻域系统中。这种方法在几个高维超混沌系统中的应用证明了它的有效性,在预测精度和预测范围方面都优于线性一阶方法和其他基于网络的方法。除了提高混沌系统的可预测性,该方法还概述了在吸引子内开发离散模型流的程序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Physical Review E
Physical Review E PHYSICS, FLUIDS & PLASMASPHYSICS, MATHEMAT-PHYSICS, MATHEMATICAL
CiteScore
4.50
自引率
16.70%
发文量
2110
期刊介绍: Physical Review E (PRE), broad and interdisciplinary in scope, focuses on collective phenomena of many-body systems, with statistical physics and nonlinear dynamics as the central themes of the journal. Physical Review E publishes recent developments in biological and soft matter physics including granular materials, colloids, complex fluids, liquid crystals, and polymers. The journal covers fluid dynamics and plasma physics and includes sections on computational and interdisciplinary physics, for example, complex networks.
期刊最新文献
Hyperedge overlap modulates synchronization transitions in higher-order Sakaguchi-Kuramoto model. Higher-order interactions enhance stochastic resonance in coupled oscillators. Spectral densities approximations of incidence-based locally treelike hypergraph matrices via the cavity method. Spatially coherent oscillations in neural fields with inhibition and adaptation. II. Two-dimensional domains. Integrability and exact large deviations of the weakly asymmetric exclusion process.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1