IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0253278

Ran Wang, Ming E Yin, Zhentao Zhao

{"title":"Chaos analyses of visco-hyperelastic cylindrical shells based on improved Melnikov method.","authors":"Ran Wang, Ming E Yin, Zhentao Zhao","doi":"10.1063/5.0253278","DOIUrl":"https://doi.org/10.1063/5.0253278","url":null,"abstract":"Soft-material structures have excellent characteristics of infinite degrees of freedom and large deformation, and it has important theoretical significance and application value to perform mathematical modeling and dynamic analysis. This paper studies the large-amplitude oscillation of the cylindrical shell under a harmonic excitation, where the constitutive relationship is described by the Zener rheological model based on the Rivlin-Saunders hyperelastic model. First, the Euler Lagrange equation is used to establish the nonlinear ordinary differential equation describing the radially symmetric motion of the structure, and the viscous evolution equation of the material is derived based on the rheological model, thus obtaining the governing equations of the nonlinear system. Second, based on the zero-viscosity and infinite-viscosity models, the bifurcation behaviors and natural frequency analyses of the nonlinear dynamics of thin-walled structures under constant loads are carried out. Third, based on the small perturbation assumption of the Maxwell unit, an improved Melnikov method suitable for the dynamic analysis of the visco-hyperelastic shells under harmonic excitation is proposed and verified by numerical methods. Finally, the chaos threshold of the system is analyzed based on the improved Melnikov method.","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143630218","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 nonlinear economy: How resource constraints lead to business cycles. 非线性经济：资源约束如何导致商业周期。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0234563

Frank Schweitzer, Giona Casiraghi

引用次数: 0

Impacts of memory-based and non-memory-based adoption in social contagion. 基于记忆和非基于记忆的采用对社会传染的影响。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0258241

Zhao-Hua Lin, Linhai Zhuo, Wangbin Ding, Xinhui Wang, Lilei Han

{"title":"Impacts of memory-based and non-memory-based adoption in social contagion.","authors":"Zhao-Hua Lin, Linhai Zhuo, Wangbin Ding, Xinhui Wang, Lilei Han","doi":"10.1063/5.0258241","DOIUrl":"10.1063/5.0258241","url":null,"abstract":"In information diffusion within social networks, whether individuals adopt information often depends on the current and past information they receive. Some individuals adopt based on current information (i.e., no memory), while others rely on past information (i.e., with memory). Previous studies mainly focused on irreversible processes, such as the classic susceptible-infected and susceptible-infected-recovered threshold models, with less attention to reversible processes like the susceptible-infected-susceptible model. In this paper, we propose a susceptible-adopted-susceptible threshold model to study the competition between these two types of nodes and its impact on information diffusion. We also examine how memory length and differences in the adoption thresholds affect the diffusion process. First, we develop homogeneous and heterogeneous mean-field theories that accurately predict simulation results. Numerical simulations reveal that when node adoption thresholds are equal, increasing memory length raises the propagation threshold, thereby suppressing diffusion. When the adoption thresholds of the two node types differ, such as non-memory nodes having a lower threshold than memory-based nodes, increasing the memory length of the latter has little effect on the propagation threshold of the former. However, when the adoption threshold of the non-memory nodes is much higher than that of the memory-based nodes, increasing the memory length of the latter significantly suppresses the propagation threshold of the non-memory nodes. In heterogeneous networks, we find that as the degree of heterogeneity increases, the outbreak size of epidemic diffusion becomes smaller, while the propagation threshold also decreases. This work offers deeper insights into the impact of memory-based and non-memory-based adoption in social contagion.","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143717803","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

Enhancing sparse identification of nonlinear dynamics with Earth-Mover distance and group similarity. 利用土方距离和群相似度增强非线性动力学稀疏识别。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0214404

Donglin Liu, Alexandros Sopasakis

引用次数: 0

Fast-slow dynamics and spike organization in the electromechanical gyrostat system: Unveiling the intricacies of shrimp structures. 机电陀螺仪系统的快慢动力学和尖峰组织：揭开虾结构的神秘面纱

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0233740

Xu-Ping Zhao, Li-Ying Xing, Jian-She Gao

引用次数: 0

Identifying patterns using cross-correlation random matrices derived from deterministic and stochastic differential equations. 使用从确定性和随机微分方程中导出的互相关随机矩阵识别模式。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0233321

Roberto da Silva, Sandra D Prado

引用次数: 0

Dynamic evolution in multi-player networked trust games with graded punishment. 具有分级惩罚的多人网络信任博弈的动态演化。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0256342

Juan Wang, Zhuo Liu, Yan Xu, Xiaopeng Li

{"title":"Dynamic evolution in multi-player networked trust games with graded punishment.","authors":"Juan Wang, Zhuo Liu, Yan Xu, Xiaopeng Li","doi":"10.1063/5.0256342","DOIUrl":"https://doi.org/10.1063/5.0256342","url":null,"abstract":"Trust holds a pivotal position in contemporary society. Yet, the question of how to elevate and sustain trust among selfish individuals poses a formidable challenge. To delve into this issue, we incorporate a graded punishment strategy into a networked N-player trust game, aiming to observe the progression of trust-related behavior. Within this game framework, punishers uphold a certain degree of trust among the participants by incurring an extra expense to exclude those who betray trust. By conducting numerous Monte Carlo simulation experiments, we uncover that the graded punishment strategy can effectively curtail untrustworthy conduct to a significant degree, potentially even eliminating such behavior, thereby fostering an improvement in the overall trust level within the population. However, to effectively deploy this strategy, it is imperative to strike a balance between the penalty cost and the penalty amount, ensuring that the natural evolution of the system is not unduly disrupted. This balance is crucial for preserving the stability and sustainability of the system while safeguarding trust. Broadly speaking, our study offers fresh insights and approaches for enhancing and maintaining trust in the networked society, while also highlighting the avenues and challenges for future research, particularly in the realm of applying graded punishment strategies.","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143604017","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

Epidemic spread dynamics in multilayer networks: Probing the impact of information outbreaks and reception games. 多层网络中的流行病传播动态：探讨信息爆发和接收博弈的影响。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0236359

Jianbo Wang, Haoxing He, Ping Li, Zhanwei Du, Xiaoke Xu

{"title":"Epidemic spread dynamics in multilayer networks: Probing the impact of information outbreaks and reception games.","authors":"Jianbo Wang, Haoxing He, Ping Li, Zhanwei Du, Xiaoke Xu","doi":"10.1063/5.0236359","DOIUrl":"https://doi.org/10.1063/5.0236359","url":null,"abstract":"The co-evolution of epidemic and information spread within multilayer networks is a current hot topic in network science. During epidemic outbreaks, the accompanying information exhibits both outbreak and reception game behaviors; yet, these complex phenomena have been scarcely addressed in existing research. In this paper, we model information outbreaks using activated individuals who transmit messages to their neighbors, while also considering the game behaviors of information receivers. By focusing on these two factors, we establish a multilayer network model featuring both information outbreaks and reception games. Employing the microscopic Markov chain method, we analyze the propagation dynamics within this network and derive epidemic thresholds, corroborating these results with Monte Carlo simulations. Our findings indicate that information outbreaks suppress epidemic outbreaks, whereas increased costs of information reception promote epidemic spread. Smooth information dissemination further inhibits the transmission of the epidemic. Additionally, we observe that heterogeneity in the network structure between the virtual and physical layers reduces the ultimate scale of epidemic infection, with the virtual layer exerting a more substantial influence. These insights are crucial for elucidating the co-evolutionary mechanisms of spread within multilayer networks and for developing effective epidemic prevention and control strategies.","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143572061","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

Optimizing self-organized topology of recurrence-based complex networks. 基于递归的复杂网络自组织拓扑优化。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0249500

Conggai Li, Joseph C S Lai, Sebastian Oberst

{"title":"Optimizing self-organized topology of recurrence-based complex networks.","authors":"Conggai Li, Joseph C S Lai, Sebastian Oberst","doi":"10.1063/5.0249500","DOIUrl":"https://doi.org/10.1063/5.0249500","url":null,"abstract":"Networks and graphs have emerged as powerful tools to model and analyze nonlinear dynamical systems. By constructing an adjacency matrix from recurrence networks, it is possible to capture critical structural and geometric information about the underlying dynamics of a time series. However, randomization of data often raises concerns about the potential loss of deterministic relationships. Here, in using the spring-electrical-force model, we demonstrate that by optimizing the distances between randomized points through minimizing an entropy-related energy measure, the deterministic structure of the original system is not destroyed. This process allows us to approximate the time series shape and correct the phase, effectively reconstructing the initial invariant set and attracting dynamics of the system. Our approach highlights the importance of adjacency matrices derived from recurrence plots, which preserve crucial information about the nonlinear dynamics. By using recurrence plots and the entropy of diagonal line lengths and leveraging the Kullback-Leibler divergence as a relative entropic measure, we fine-tune the parameters and initial conditions for recurrence plots, ensuring an optimal representation of the system's dynamics. Through the integration of network geometry and energy minimization, we show that data-driven graphs can self-organize to retain and regenerate the fundamental features of the time series, including its phase space structures. This study underscores the robustness of recurrence networks as a tool for analyzing nonlinear systems and demonstrates that randomization, when guided by informed optimization, does not erase deterministic relationships, opening new avenues for reconstructing dynamical systems from observational data.","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143572195","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

Power Levy motion. I. Diffusion. 电力征收动议。一、扩散。

IF 2.7 2区数学

Chaos Pub Date : 2025-03-01 DOI: 10.1063/5.0251337

Iddo Eliazar

引用次数: 0

Chaos最新文献