Chaos最新文献

{"title":"Synchronization and extreme events in multiplex FitzHugh-Nagumo networks under heterogeneous noise.","authors":"S Hariharan, R Suresh, V K Chandrasekar","doi":"10.1063/5.0304868","DOIUrl":"https://doi.org/10.1063/5.0304868","url":null,"abstract":"<p><p>Neuronal systems are highly susceptible to noise, which can trigger erratic, abrupt, and sudden dynamical transitions known as extreme events (EEs). The FitzHugh-Nagumo (FHN) model, a minimal yet powerful two-dimensional representation of neuronal dynamics, has been extensively employed to investigate noise-induced behaviors in both single neurons and monolayer networks. In this work, we extend these studies to a multiplex network consisting of two layers of FHN oscillators with non-local coupling, where each layer is exposed to heterogeneous noise. Our results demonstrate that at low-noise intensities, the probability of EE occurrence increases when neurons exhibit weak synchronization. This weak synchrony acts as a precursor that facilitates the onset of collective firing. However, as the network approaches complete synchrony, the probability of EE decreases sharply and can be entirely suppressed by strengthening the inter-layer coupling. In contrast, at high-noise intensities, EEs disappear in the weakly synchronized regime but re-emerge in the strongly synchronized regime. This reappearance of synchronized EE highlights the critical interplay between noise and coupling. Notably, the observed emergence of EE at both low- and high-noise levels is robust across all coupling ranges from local to global connectivity. These findings provide deeper insight into the mechanisms governing EE generation and neuronal synchronization, offering potential implications for understanding seizure-like dynamics in biological neural systems.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147503295","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}

{"title":"Controlling severe atopic dermatitis dynamics.","authors":"Yoseb Kang, Ying-Cheng Lai","doi":"10.1063/5.0308283","DOIUrl":"https://doi.org/10.1063/5.0308283","url":null,"abstract":"<p><p>Atopic dermatitis (AD) is a pervasive inflammatory skin disease, with severe forms constituting a refractory phenotype that devastates quality of life through relentless pruritus, widespread lesions, and resistance to standard therapies. A central clinical challenge is to steer the disease away from chronic inflammation and sustain remission. Framed in dynamical terms, this amounts to controlling the remission dynamics of AD. We establish a mathematical framework for the canonical two-phase clinical strategy: the \"Get Control\" (GC) phase, where antibiotics are administered to suppress acute inflammation, and the \"Keep Control\" (KC) phase, where emollients are applied to maintain remission. A key question of therapeutic relevance is: what are the minimal drug doses required for each phase to succeed? Our analysis reveals scaling laws that tie the control amplitude (drug dose) directly to two fundamental determinants of severe AD: barrier permeability and immune clearance capacity. These laws delineate the antibiotic dosage required to exit chronic inflammation in GC and the emollient level needed to sustain remission in KC. The uncovered scaling principles elevate treatment design from heuristic to quantitative, leading to a theoretical framework for precision, phase-based analysis of treatment control in severe AD. By aligning clinical intervention with the dynamical structure of the disease, the framework points toward personalized, optimally dosed strategies for overcoming refractory cases.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147472714","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}

{"title":"Loschmidt echo and scrambling of systematic errors in tomography-A quantum signature of chaos.","authors":"Abinash Sahu, Naga Dileep Varikuti, Vaibhav Madhok","doi":"10.1063/5.0289048","DOIUrl":"https://doi.org/10.1063/5.0289048","url":null,"abstract":"<p><p>How does quantum chaos lead to rapid scrambling of information as well as systematic errors across a system when one introduces perturbations in the dynamics? What are its consequences for the reliability of quantum simulations and quantum information processing? We employ continuous measurement quantum tomography as a paradigm to study these questions. The measurement record is generated as a sequence of expectation values of a Hermitian observable evolving under repeated application of the Floquet map of the quantum kicked top. We construct a quantity to capture the scrambling of systematic errors, an out-of-time-ordered correlator (OTOC), which serves as a signature of chaos and quantifies the spread of errors. We show that the spread of errors, as quantified by the OTOC, is related to the operator Loschmidt echo, which is defined as the Hilbert-Schmidt inner product of the operators On, and O'n generated from repeated application of the Floquet map for ideal (unperturbed) dynamics and the true (perturbed) dynamics, respectively. This also gives us an operational interpretation of Loschmidt echo (LE) for operators by connecting it to the performance of quantum tomography. We show how our results demonstrate not only a link between LE and scrambling of errors different than previous studies, but also that such a link can have operational consequences in quantum information processing.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147467032","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}

{"title":"Erratum: \"Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines\" [Chaos 27, 023107 (2017)].","authors":"Fabio L Traversa, Massimiliano Di Ventra","doi":"10.1063/5.0328214","DOIUrl":"https://doi.org/10.1063/5.0328214","url":null,"abstract":"","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147431132","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}

{"title":"Explosive synchronization in networks of type-I neurons with electrical synapses.","authors":"Akshay S Harish, Gaurav Dar","doi":"10.1063/5.0314833","DOIUrl":"https://doi.org/10.1063/5.0314833","url":null,"abstract":"<p><p>Explosive synchronization (ES), which was observed in the scale-free network of the Kuramoto model [J. Gómez-Gardeñes et al., Phys. Rev. Lett. 106, 128701 (2011)], has been studied widely in the oscillator model. However, investigations of ES in neuronal networks, in spite of their importance in neuroscience, are limited and restricted to specific models. In this work, we explore the nature of the transition to synchronization in a class of neurons, namely, type-I neurons. Leveraging the mapping between networks of weakly heterogeneous type-I neurons and the Kuramoto model [P. Clusella et al., Chaos 32, 013105 (2022)] under weak coupling, we investigate whether the conditions known to induce ES in the Kuramoto model also do so in type-I neurons. The neurons are coupled through electrical synapses and placed on scale-free and star networks with complete and partial degree-frequency correlation conditions. Our simulations show ES in networks of Quadratic Integrate and Fire (QIF) neurons, the normal form of type-I neurons close to saddle node on invariant circle (SNIC) bifurcation, under weak heterogeneity. We further generalize this phenomenon to networks of type-I Morris-Lecar neurons, under conditions similar to those of QIF neurons. Thus, this work suggests conditions under which ES can arise in type-I neurons close to SNIC bifurcation under weak heterogeneity and weak electrical coupling.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147509746","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}

{"title":"A mathematical framework for misinformation propagation in complex networks: Topology-dependent distortion and control.","authors":"Saikat Sur, Rohitashwa Chattopadhyay, Jens Christian Claussen, Archan Mukhopadhyay","doi":"10.1063/5.0318657","DOIUrl":"https://doi.org/10.1063/5.0318657","url":null,"abstract":"<p><p>Misinformation is pervasive in natural, biological, social, and engineered systems, yet its quantitative characterization remains challenging due to context-dependent errors and the heterogeneous structure of real-world interaction networks. We develop a general mathematical framework for quantifying information distortion in distributed systems by modeling how local transmission errors accumulate along network geodesics and reshape each agent's perceived global state. Through a drift-fluctuation decomposition of pathwise binomial noise, we derive closed-form expressions for node-level perception distributions and show that directional bias induces only a uniform shift in the mean, preserving the fluctuation structure. This establishes a previously unreported shift-invariance principle governing error propagation in networks. Applying the framework to canonical graph ensembles, we uncover strong topological signatures of misinformation: Erdős-Rényi random graphs exhibit a double-peaked distortion profile driven by connectivity transitions and geodesic-length fluctuations, scale-free networks suppress misinformation through hub-mediated integration, and optimally rewired small-world networks achieve comparable suppression by balancing clustering with short paths. A direct comparison across regular lattices, Erdős-Rényi random graphs, Watts-Strogatz small-world networks, and Barabási-Albert scale-free networks reveals a connectivity-dependent crossover. In the extremely sparse regime, scale-free and Erdős-Rényi networks behave similarly. At intermediate sparsity, Watts-Strogatz small-world networks exhibit the lowest misinformation. In contrast, Barabási-Albert scale-free networks maintain low misinformation in sparse and dense regimes, while regular lattices produce the highest distortion across connectivities. We additionally show how sparsity constraints, structural organization, and connection costs delineate regimes of minimal misinformation. Overall, our results provide an analytically tractable foundation for understanding and controlling information reliability in complex networked systems.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147354076","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}

{"title":"A multichannel generalization of the HAVOK method for the analysis of nonlinear dynamical systems.","authors":"Carlos Colchero, Jorge E Pérez-García, Alvaro Herrera, Oliver Probst","doi":"10.1063/5.0303718","DOIUrl":"https://doi.org/10.1063/5.0303718","url":null,"abstract":"<p><p>By extending Takens' embedding theorem [Dynamical Systems and Turbulence, Warwick 1980, edited by D. Rand and L.-S. Young (Springer, Berlin, 1981), pp. 366-381], Deyle and Sugihara [PLoS One 6, 1-8 (2011)] provided a theoretical justification for using parallel measurement time series to reconstruct a system's attractor. Building on Takens' framework, Brunton et al. [Nat. Commun. 8, 19 (2017)] introduced the Hankel alternative view of Koopman (HAVOK) algorithm, a data-driven approach capable of linearizing chaotic systems through delay embeddings. In this work, a modified version of the original algorithm (mHAVOK) is presented, a practical realization of Deyle and Sugihara's generalized embedding theory. mHAVOK extends the original algorithm from one to multiple input time series and introduces a systematic approach to separating linear and nonlinear terms. An R2-informed quality score is introduced and shown to be a reliable guide for the selection of the reduced rank. The algorithm is tested on the familiar Lorenz system, as well as the more sophisticated Sprott system, which features different behaviors depending on the initial conditions. The quality of the reconstructions is assessed with the Chamfer distance, validating how mHAVOK allows for a more accurate reconstruction of the system dynamics. The new methodology generalizes HAVOK by allowing the analysis of multivariate time series, fundamental in real-life data-driven applications.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147354079","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}

{"title":"Threshold of a stochastic SIQRS epidemic model with nonlinear incidence rate and lognormal Ornstein-Uhlenbeck process.","authors":"Qun Liu, Qingmei Chen","doi":"10.1063/5.0307391","DOIUrl":"https://doi.org/10.1063/5.0307391","url":null,"abstract":"<p><p>In this paper, we first develop a deterministic susceptible-infected-quarantined-recovered-susceptible epidemic model with nonlinear incidence rate and investigate the global stability of the equilibria of the model. Then, we extend the deterministic model to a stochastic framework by introducing the lognormal Ornstein-Uhlenbeck process to model the inherent randomness of the disease transmission. Following that, we analyze the stochastic dynamics of the model in detail. More precisely, by adopting the Markov semigroup theory and Lyapunov function techniques, we first establish sufficient criteria for the existence and uniqueness of an invariant probability measure of the model when the parameter R0S>1, indicating the strong persistence of the disease. Afterward, under the same conditions as the global stability of the endemic equilibrium, we achieve the concrete form of the local probability density function near the quasi-endemic equilibrium of the stochastic model. Simultaneously, we also show that the invariant global probability density function can be approximated by the local probability density function when the noise intensity approaches zero. Subsequently, sufficient criteria for disease extinction are presented when the parameter R0S<1. Crucially, we obtain the threshold that determines the outbreak or extinction of the disease. Finally, several examples together with comprehensive numerical simulations are performed to confirm our analytical findings.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147467121","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}

{"title":"Equivalence formulas for generalized spread rates.","authors":"Jung-Chao Ban, Jyy-I Hong, Chen-Han Hsu, Bo-Chao Huang, Cheng-Yu Tsai","doi":"10.1063/5.0302400","DOIUrl":"https://doi.org/10.1063/5.0302400","url":null,"abstract":"<p><p>This paper develops a quantitative framework for comparing spread models motivated by rate-based comparisons commonly used in epidemic, population, and spatial propagation studies. We consider 1-spread models on d-ary trees and define the spread rate as the asymptotic proportion of type occurrences in infinite spread patterns. This notion is further extended to generalized spread rates through input-output type vectors, allowing intergenerational transformations to be systematically described. Using ξ-matrices together with elementary and finite shift equivalence, we derive explicit relations between spread rates of different systems. Central to this comparison is the transition constant, a relational quantity that measures the relative dilation or attenuation of asymptotic spread rates between two spread models whose ξ-matrices are finite shift equivalent. We show that the set of attainable transition constants is dense in [1,∞), revealing a wide spectrum of quantitative rate relationships beyond qualitative equivalence. Finally, the framework is applied to population systems by incorporating a movement function, leading to the notion of distribution rates that capture both population growth and spatial migration.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147509733","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}

{"title":"Design and implementation of a heterogeneous multi-cavity hyperchaotic map derived from complex exponential functions.","authors":"Zeping Zhang, Huihai Wang, Kehui Sun","doi":"10.1063/5.0312933","DOIUrl":"https://doi.org/10.1063/5.0312933","url":null,"abstract":"<p><p>To enhance the structural complexity of multi-cavity chaotic maps, a new complex exponential chaotic map (CECM) is proposed based on complex exponential functions. Its attractor shape is sensitive to parameters. By integrating the CECM with step functions, a heterogeneous multi-cavity hyperchaotic map (HMCM) is created that generates multiple cavities with unique structures, enhancing system complexity. Dynamical analyses, including attractor phase diagram, Lyapunov exponents, and permutation entropy complexity, verify the hyperchaotic performance across a wide parameter range. The HMCM is implemented on a digital signal processor platform, performing on-chip computations of the bifurcation diagram and Lyapunov exponents. The integrated hardware analysis confirms the physical feasibility, robust chaos, and low-resource usage of the map.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"36 3","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147364054","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}