Chaos最新文献

筛选
英文 中文
Cross-diffusion waves by cellular automata modeling: Pattern formation in porous media.
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0233077
Zhennan Zhu, Klaus Regenauer-Lieb, Manman Hu
{"title":"Cross-diffusion waves by cellular automata modeling: Pattern formation in porous media.","authors":"Zhennan Zhu, Klaus Regenauer-Lieb, Manman Hu","doi":"10.1063/5.0233077","DOIUrl":"https://doi.org/10.1063/5.0233077","url":null,"abstract":"<p><p>Porous earth materials exhibit large-scale deformation patterns, such as deformation bands, which emerge from complex small-scale interactions. This paper introduces a cross-diffusion framework designed to capture these multiscale, multiphysics phenomena, inspired by the study of multi-species chemical systems. A microphysics-enriched continuum approach is developed to accurately predict the formation and evolution of these patterns. Utilizing a cellular automata algorithm for discretizing the porous network structure, the proposed framework achieves substantial computational efficiency in simulating the pattern formation process. This study focuses particularly on a dynamic regime termed \"cross-diffusion wave,\" an instability in porous media where cross-diffusion plays a significant role-a phenomenon experimentally observed in materials like dry snow. The findings demonstrate that external thermodynamic forces can initiate pattern formation in cross-coupled dynamic systems, with the propagation speed of deformation bands primarily governed by cross-diffusion and a specific cross-reaction coefficient. Owing to the universality of thermodynamic force-flux relationships, this study sheds light on a generic framework for pattern formation in cross-coupled multi-constituent reactive systems.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143022432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A hybrid dual-branch model with recurrence plots and transposed transformer for stock trend prediction. 具有递归图和转置变压器的混合双分支模型用于股票走势预测。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0233275
Jingyu Su, Haoyu Li, Ruiqi Wang, Wei Guo, Yushi Hao, Jürgen Kurths, Zhongke Gao
{"title":"A hybrid dual-branch model with recurrence plots and transposed transformer for stock trend prediction.","authors":"Jingyu Su, Haoyu Li, Ruiqi Wang, Wei Guo, Yushi Hao, Jürgen Kurths, Zhongke Gao","doi":"10.1063/5.0233275","DOIUrl":"https://doi.org/10.1063/5.0233275","url":null,"abstract":"<p><p>Stock trend prediction is a significant challenge due to the inherent uncertainty and complexity of stock market time series. In this study, we introduce an innovative dual-branch network model designed to effectively address this challenge. The first branch constructs recurrence plots (RPs) to capture the nonlinear relationships between time points from historical closing price sequences and computes the corresponding recurrence quantifification analysis measures. The second branch integrates transposed transformers to identify subtle interconnections within the multivariate time series derived from stocks. Features extracted from both branches are concatenated and fed into a fully connected layer for binary classification, determining whether the stock price will rise or fall the next day. Our experimental results based on historical data from seven randomly selected stocks demonstrate that our proposed dual-branch model achieves superior accuracy (ACC) and F1-score compared to traditional machine learning and deep learning approaches. These findings underscore the efficacy of combining RPs with deep learning models to enhance stock trend prediction, offering considerable potential for refining decision-making in financial markets and investment strategies.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142962002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Clustering time-evolving networks using the spatiotemporal graph Laplacian. 基于时空图拉普拉斯的时变网络聚类。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0228419
Maia Trower, Natasa Djurdjevac Conrad, Stefan Klus
{"title":"Clustering time-evolving networks using the spatiotemporal graph Laplacian.","authors":"Maia Trower, Natasa Djurdjevac Conrad, Stefan Klus","doi":"10.1063/5.0228419","DOIUrl":"https://doi.org/10.1063/5.0228419","url":null,"abstract":"<p><p>Time-evolving graphs arise frequently when modeling complex dynamical systems such as social networks, traffic flow, and biological processes. Developing techniques to identify and analyze communities in these time-varying graph structures is an important challenge. In this work, we generalize existing spectral clustering algorithms from static to dynamic graphs using canonical correlation analysis to capture the temporal evolution of clusters. Based on this extended canonical correlation framework, we define the spatiotemporal graph Laplacian and investigate its spectral properties. We connect these concepts to dynamical systems theory via transfer operators and illustrate the advantages of our method on benchmark graphs by comparison with existing methods. We show that the spatiotemporal graph Laplacian allows for a clear interpretation of cluster structure evolution over time for directed and undirected graphs.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142962116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The applicability limits of the lowest-order substitute model for a cantilever beam system hard-impacting a moving base. 硬冲击运动基座的悬臂梁系统的最低阶替代模型的适用范围。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0244817
Barbara Blazejczyk-Okolewska
{"title":"The applicability limits of the lowest-order substitute model for a cantilever beam system hard-impacting a moving base.","authors":"Barbara Blazejczyk-Okolewska","doi":"10.1063/5.0244817","DOIUrl":"https://doi.org/10.1063/5.0244817","url":null,"abstract":"<p><p>This paper examines the circumstances under which a one-degree-of-freedom approximate system can be employed to predict the dynamics of a cantilever beam comprising an elastic element with a significant mass and a concentrated mass embedded at its end, impacting a moving rigid base. A reference model of the system was constructed using the finite element method, and an approximate lowest-order model was proposed that could be useful in engineering practice for rapidly ascertaining the dynamics of the system, particularly for predicting both periodic and chaotic motions. The number of finite elements in the reference model was determined based on the calculated values of natural frequencies, which were found to correspond to the values of natural frequencies derived from the application of analytical formulas. The precision of the parameter identification and the outcomes yielded by the substitute model were validated through the calculation of the regions of stable periodic solutions using the analytical Peterka method. Subsequently, the qualitative and quantitative limits of the substitute model's applicability were determined. The quantitative limits were delineated through the utilization of Lyapunov exponents and characteristics associated with the energy dissipation due to impacts and the average number of impacts per excitation period. These characteristics provide a foundation for the introduction of global distance measures of the dynamic behavior of diverse systems within a specified range of the control parameter.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142945593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Continuum limit of the adaptive Kuramoto model. 自适应Kuramoto模型的连续统极限。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0226759
Rok Cestnik, Erik A Martens
{"title":"Continuum limit of the adaptive Kuramoto model.","authors":"Rok Cestnik, Erik A Martens","doi":"10.1063/5.0226759","DOIUrl":"10.1063/5.0226759","url":null,"abstract":"<p><p>We investigate the dynamics of the adaptive Kuramoto model with slow adaptation in the continuum limit, N→∞. This model is distinguished by dense multistability, where multiple states coexist for the same system parameters. The underlying cause of this multistability is that some oscillators can lock at different phases or switch between locking and drifting depending on their initial conditions. We identify new states, such as two-cluster states. To simplify the analysis, we introduce an approximate reduction of the model via row-averaging of the coupling matrix. We derive a self-consistency equation for the reduced model and present a stability diagram illustrating the effects of positive and negative adaptation. Our theoretical findings are validated through numerical simulations of a large finite system. Comparisons of previous work highlight the significant influence of adaptation on synchronization behavior.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142920842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Directed recurrence networks for the analysis of nonlinear and complex dynamical systems. 非线性和复杂动力系统的有向递归网络分析。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0235311
Rémi Delage, Toshihiko Nakata
{"title":"Directed recurrence networks for the analysis of nonlinear and complex dynamical systems.","authors":"Rémi Delage, Toshihiko Nakata","doi":"10.1063/5.0235311","DOIUrl":"10.1063/5.0235311","url":null,"abstract":"<p><p>Complex network approaches have been emerging as an analysis tool for dynamical systems. Different reconstruction methods from time series have been shown to reveal complicated behaviors that can be quantified from the network's topology. Directed recurrence networks have recently been suggested as one such method, complementing the already successful recurrence networks and expanding the applications of recurrence analysis. We investigate here their performance for the analysis of nonlinear and complex dynamical systems. It is shown that there is a strong parallel with previous Markov chain approximations of the transfer operator, as well as a few differences explained by their structure. Notably, the spectral analysis provides crucial information on the dynamics of the system, such as its complexity or dynamical patterns and their stability. Possible advantages of the directed recurrence network approach include the preserved data resolution and well defined recurrence threshold.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142920846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Random walks on scale-free flowers with stochastic resetting. 具有随机重置的无标度花上的随机漫步。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0242793
Anlin Li, Xiaohan Sun, Shaoxiang Zhu, Feng Zhu
{"title":"Random walks on scale-free flowers with stochastic resetting.","authors":"Anlin Li, Xiaohan Sun, Shaoxiang Zhu, Feng Zhu","doi":"10.1063/5.0242793","DOIUrl":"https://doi.org/10.1063/5.0242793","url":null,"abstract":"<p><p>This study explores the impact of stochastic resetting on the random walk dynamics within scale-free (u,v)-flowers. Utilizing the generating function technique, we develop a recursive relationship for the generating function of the first passage time and establish a connection between the mean first passage time with and without resetting. Our investigation spans multiple scenarios, with the random walker starting from various positions and aiming to reach different target nodes, allowing us to identify the optimal resetting probability that minimizes the mean first passage time for each case. We demonstrate that stochastic resetting significantly improves search efficiency, especially in larger networks. These findings underscore the effectiveness of stochastic resetting as a strategy for optimizing search algorithms in complex networks, offering valuable applications in domains such as biological transport, data networks, and search processes where rapid and efficient exploration is vital.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142962120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rigorous numerical study of the density of periodic windows for the logistic map. 对logistic映射的周期窗密度进行了严格的数值研究。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0250869
Zbigniew Galias
{"title":"Rigorous numerical study of the density of periodic windows for the logistic map.","authors":"Zbigniew Galias","doi":"10.1063/5.0250869","DOIUrl":"https://doi.org/10.1063/5.0250869","url":null,"abstract":"<p><p>Numerical study of periodic windows for the logistic map is carried out. Accurate rigorous bounds for periodic windows' end points are computed using interval arithmetic based tools. An efficient method to find the periodic window with the smallest period lying between two other periodic windows is proposed. The method is used to find periodic windows extremely close to selected points in the parameter space and to find a set of periodic windows to minimize the maximum gap between them. The maximum gap reached is 4×10-9. The phenomenon of the existence of regions free from low-period windows is explained.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143001082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Effects of local mutations in quadratic iterations. 二次迭代中局部突变的影响。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0233478
Anca Rǎdulescu, Abraham Longbotham, Ashelee Collier
{"title":"Effects of local mutations in quadratic iterations.","authors":"Anca Rǎdulescu, Abraham Longbotham, Ashelee Collier","doi":"10.1063/5.0233478","DOIUrl":"https://doi.org/10.1063/5.0233478","url":null,"abstract":"<p><p>We introduce mutations in the process of discrete iterations of complex quadratic maps in the family fc(z)=z2+c. More specifically, we consider a \"correct\" function fc1 acting on the complex plane. A \"mutation\" fc0 is a different (\"erroneous\") map acting on a locus of given radius r around a mutation focal point ξ∗. The effect of the mutation is interpolated radially to eventually recover the original map fc1 when reaching an outer radius R. We call the resulting map a \"mutated\" map. In the theoretical framework of mutated iterations, we study how a mutation affects the temporal evolution of the system and the asymptotic behavior of its orbits. We use the prisoner set of the system to quantify simultaneously the long-term behavior of the entire space under mutated maps. We analyze how the position, timing, and size of the mutation can alter the system's long-term evolution (as encoded in the topology of its prisoner set). The framework is then discussed as a metaphoric model for studying the impact of copying errors in natural replication systems.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143000943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling shock propagation and resilience in financial temporal networks. 金融时间网络中的冲击传播和弹性建模。
IF 2.7 2区 数学
Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0244665
Fabrizio Lillo, Giorgio Rizzini
{"title":"Modeling shock propagation and resilience in financial temporal networks.","authors":"Fabrizio Lillo, Giorgio Rizzini","doi":"10.1063/5.0244665","DOIUrl":"https://doi.org/10.1063/5.0244665","url":null,"abstract":"<p><p>Modeling how a shock propagates in a temporal network and how the system relaxes back to equilibrium is challenging but important in many applications, such as financial systemic risk. Most studies, so far, have focused on shocks hitting a link of the network, while often it is the node and its propensity to be connected that are affected by a shock. Using the configuration model-a specific exponential random graph model-as a starting point, we propose a vector autoregressive (VAR) framework to analytically compute the Impulse Response Function (IRF) of a network metric conditional to a shock on a node. Unlike the standard VAR, the model is a nonlinear function of the shock size and the IRF depends on the state of the network at the shock time. We propose a novel econometric estimation method that combines the maximum likelihood estimation and Kalman filter to estimate the dynamics of the latent parameters and compute the IRF, and we apply the proposed methodology to the dynamical network describing the electronic market of interbank deposit.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142982805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信