Chaos最新文献_第5页

Random walks with long-range memory on networks. 网络上具有长期记忆的随机漫步。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0243892

Ana Gabriela Guerrero-Estrada, Alejandro P Riascos, Denis Boyer

引用次数: 0

Synchronization of two coupled massive oscillators in the time-delayed Kuramoto model. 延时Kuramoto模型中两个耦合大质量振子的同步。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0228203

Esmaeil Mahdavi, Mina Zarei, Farhad Shahbazi

引用次数: 0

Taming chimeras in coupled oscillators using soft actor-critic based reinforcement learning. 利用基于软行为批判的强化学习，驯服耦合振荡器中的 "嵌合体"。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0219748

Jianpeng Ding, Youming Lei, Michael Small

{"title":"Taming chimeras in coupled oscillators using soft actor-critic based reinforcement learning.","authors":"Jianpeng Ding, Youming Lei, Michael Small","doi":"10.1063/5.0219748","DOIUrl":"https://doi.org/10.1063/5.0219748","url":null,"abstract":"We propose a universal method based on deep reinforcement learning (specifically, soft actor-critic) to control the chimera state in the coupled oscillators. The policy for control is learned by maximizing the expectation of the cumulative reward in the reinforcement learning framework. With the aid of the local order parameter, we design a class of reward functions for controlling the chimera state, specifically confining the spatial position of coherent and incoherent domains to any desired lateral position of oscillators. The proposed method is model-free, in contrast to the control schemes that require complete knowledge of the system equations. We test the method on the locally coupled Kuramoto oscillators and the nonlocally coupled FitzHugh-Nagumo model. Results show that the control is independent of initial conditions and coupling schemes. Not only the single-headed chimera, but also the multi-headed chimera and even the alternating chimera can be obtained by the method, and only the desired position needs to be changed. Beyond that, we discuss the influence of hyper-parameters, demonstrate the universality of the method to network sizes, and show that the proposed method can stabilize the drift of chimera and prevent its collapse in small networks.","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":"142982812","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 topology of a chaotic attractor in the Kuramoto-Sivashinsky equation. Kuramoto-Sivashinsky方程中混沌吸引子的拓扑。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0237476

Marie Abadie, Pierre Beck, Jeremy P Parker, Tobias M Schneider

{"title":"The topology of a chaotic attractor in the Kuramoto-Sivashinsky equation.","authors":"Marie Abadie, Pierre Beck, Jeremy P Parker, Tobias M Schneider","doi":"10.1063/5.0237476","DOIUrl":"https://doi.org/10.1063/5.0237476","url":null,"abstract":"The Birman-Williams theorem gives a connection between the collection of unstable periodic orbits (UPOs) contained within a chaotic attractor and the topology of that attractor, for three-dimensional systems. In certain cases, the fractal dimension of a chaotic attractor in a partial differential equation (PDE) is less than three, even though that attractor is embedded within an infinite-dimensional space. Here, we study the Kuramoto-Sivashinsky PDE at the onset of chaos. We use two different dimensionality-reduction techniques-proper orthogonal decomposition and an autoencoder neural network-to find two different mappings of the chaotic attractor into three dimensions. By finding the image of the attractor's UPOs in these reduced spaces and examining their linking numbers, we construct templates for the branched manifold, which encodes the topological properties of the attractor. The templates obtained using two different dimensionality reduction methods are equivalent. The organization of the periodic orbits is identical and consistent symbolic sequences for low-period UPOs are derived. While this is not a formal mathematical proof, this agreement is strong evidence that the dimensional reduction is robust, in this case, and that an accurate topological characterization of the chaotic attractor of the chaotic PDE has been achieved.","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":"142962125","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

Analytical and numerical studies for integrable and non-integrable fractional discrete modified Korteweg-de Vries hierarchies. 可积分和不可积分分数离散修正 Korteweg-de Vries 层次的分析和数值研究。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0245319

Qin-Ling Liu, Rui Guo, Ya-Hui Huang, Xin Li

引用次数: 0

Dynamical properties of the composed Logistic-Gauss map. 合成logistic -高斯映射的动力学性质。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0238591

Luam Silva de Paiva, Julia G S Rocha, Joelson D V Hermes, Matheus Hansen, Ricardo Luiz Viana, Iberê Luiz Caldas, Rene O Medrano-T, Diogo Ricardo da Costa

{"title":"Dynamical properties of the composed Logistic-Gauss map.","authors":"Luam Silva de Paiva, Julia G S Rocha, Joelson D V Hermes, Matheus Hansen, Ricardo Luiz Viana, Iberê Luiz Caldas, Rene O Medrano-T, Diogo Ricardo da Costa","doi":"10.1063/5.0238591","DOIUrl":"https://doi.org/10.1063/5.0238591","url":null,"abstract":"This study focuses on the analysis of a unique composition between two well-established models, known as the Logistic-Gauss map. The investigation cohesively transitions to an exploration of parameter space, essential for unraveling the complexity of dissipative mappings and understanding the intricate relationships between periodic structures and chaotic regions. By manipulating control parameters, our approach reveals intriguing patterns, with findings enriched by extreme orbits, trajectories that connect local maximum and minimum values of one-dimensional maps. This theory enhances our perception of structural organization and offers valuable perceptions of the system behaviors, contributing to an expanded understanding of chaos and periodicity in dynamic systems. The analysis reveals Complex Sets of Periodicity (CSP) in the parameter space, characterized by superstable curves that traverse their main bodies. The exploration of different combinations of parameters shows cascades of CSP structures with added periods and are organized based on extreme curves. This investigation offers valuable discoveries of the dynamics of dissipative mappings, opening avenues for future explorations in chaotic systems.","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":"142962118","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

Sonogenetics is a novel antiarrhythmic mechanism. 声遗传学是一种新的抗心律失常机制。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0224817

Yang Li, Xingang Wang, Jianzhong Guo, Yong Wang, Vladimir Zykov, Eberhard Bodenschatz, Xiang Gao

引用次数: 0

Random walks with stochastic resetting in complex networks: A discrete-time approach. 复杂网络中具有随机重置的随机行走：一种离散时间方法。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0238517

Thomas M Michelitsch, Giuseppe D'Onofrio, Federico Polito, Alejandro P Riascos

{"title":"Random walks with stochastic resetting in complex networks: A discrete-time approach.","authors":"Thomas M Michelitsch, Giuseppe D'Onofrio, Federico Polito, Alejandro P Riascos","doi":"10.1063/5.0238517","DOIUrl":"https://doi.org/10.1063/5.0238517","url":null,"abstract":"We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes of the network are target nodes, and we focus on the statistics of first hitting of these nodes. In the non-Markov case of the renewal process, we consider both light- and fat-tailed inter-reset distributions. We derive the propagator matrix in terms of discrete backward recurrence time probability density functions, and in the light-tailed case, we show the existence of a non-equilibrium steady state. In order to tackle the non-Markov scenario, we derive a defective propagator matrix, which describes an auxiliary walk characterized by killing the walker as soon as it hits target nodes. This propagator provides the information on the mean first passage statistics to the target nodes. We establish sufficient conditions for ergodicity of the walk under resetting. Furthermore, we discuss a generic resetting mechanism for which the walk is non-ergodic. Finally, we analyze inter-reset time distributions with infinite mean where we focus on the Sibuya case. We apply these results to study the mean first passage times for Markovian and non-Markovian (Sibuya) renewal resetting protocols in realizations of Watts-Strogatz and Barabási-Albert random graphs. We show nontrivial behavior of the dependence of the mean first passage time on the proportions of the relocation nodes, target nodes, and of the resetting rates. It turns out that, in the large-world case of the Watts-Strogatz graph, the efficiency of a random searcher particularly benefits from the presence of resets.","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":"142945627","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

Koopman learning with episodic memory. 库普曼情景记忆学习。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0245244

William T Redman, Dean Huang, Maria Fonoberova, Igor Mezić

引用次数: 0

Bernoulli trial under subsystem restarts: Two competing searchers looking for a target. 子系统重启下的伯努利试验：两个相互竞争的搜索者寻找目标。

IF 2.7 2区数学

Chaos Pub Date : 2025-01-01 DOI: 10.1063/5.0238201

R K Singh, R Metzler, T Sandev

引用次数: 0