arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.04319nlin.PSmath-phmath.DSmath.MPnlin.AO
收藏

有限传播增强反应-扩散网络系统中的图灵斑图

Finite propagation enhances Turing patterns in reaction-diffusion networked systems

University of Namur(南纳穆尔大学)

Timoteo Carletti, Riccardo Muolo

AI总结:

该研究将 Cattaneo 有限传播框架引入复杂网络上的反应-扩散系统,证明图灵不稳定性可在更广泛条件下出现,并通过扩展的 FitzHugh-Nagumo 模型模拟验证。

摘要:

我们在此发展了在有限传播假设下定义于复杂网络上的反应-扩散系统的图灵不稳定性理论。通过将 Cattaneo 在20世纪40年代提出的框架扩展到网络系统,我们去除了反应-扩散系统中存在的无限传播速度这一非物理假设,从而能够对精细调节问题及现有实验提出全新视角。我们通过解析证明,静止或波状的图灵不稳定性会在广泛得多的条件下出现,例如当激活剂扩散快于抑制剂时,甚至在抑制剂-抑制剂系统中也会出现,从而突破了经典图灵框架。解析结果与在 FitzHugh-Nagumo 模型上进行的直接模拟进行了比较,该模型被扩展到以复杂网络作为动力学基底的相对论性反应-扩散框架中。

英文摘要:

We hereby develop the theory of Turing instability for reaction-diffusion systems defined on complex networks assuming finite propagation. Extending to networked systems the framework introduced by Cattaneo in the 40's, we remove the unphysical assumption of infinite propagation velocity holding for reaction-diffusion systems, thus allowing to propose a novel view on the fine tuning issue and on existing experiments. We analytically prove that Turing instability, stationary or wave-like, emerges for a much broader set of conditions, e.g., once the activator diffuses faster than the inhibitor or even in the case of inhibitor-inhibitor systems, overcoming thus the classical Turing framework. Analytical results are compared to direct simulations made on the FitzHugh-Nagumo model, extended to the relativistic reaction-diffusion framework with a complex network as substrate for the dynamics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑