arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.13080cond-mat.stat-mechmath.DSnlin.PS
收藏

矩阵加权网络中的图灵图案

Turing patterns in Matrix-Weighted Networks

IMT School for Advanced Studies(高等研究IMT学院);INdAM-GNAMPA Istituto Nazionale di Alta Matematica ‘Francesco Severi’(意大利高等数学国家研究所‘弗朗切斯科·塞韦里’);University of Namur(那慕尔大学)

Anna Gallo, Wilfried Segnou, Timoteo Carletti

AI总结:

本文研究了矩阵加权网络中图灵图案的形成机制,通过引入节点依赖的正交矩阵,将相干网络的扩散转换为标准加权网络,从而分析网络拓扑、权重和变换对图案形成的影响。

摘要:

扩散驱动不稳定性是空间扩展系统中图案形成的基本机制。在几乎所有现有的研究中,底层网络链接上的扩散是通过标量权重建模的,可能还补充了在链接之间均匀的交叉扩散项。在本工作中,我们研究了在矩阵加权网络(MWN)上图灵图案的出现,这是一种最近引入的框架,其中每条边都与一个矩阵权重相关联。专注于相干MWN的类别,我们提供了一种新的相干性表征,以节点依赖的正交矩阵的形式,表明链接变换可以写成节点之间的相对旋转。这种表示方法使我们能够处理任意大小的相干MWN,并引入一种正交变量变换,能够将相干MWN上的扩散转换为具有标量权重的标准加权网络上的扩散。在此基础上,我们将经典的图灵不稳定性分析扩展到MWN,并推导出由于矩阵加权扩散导致局部动力学均匀平衡丧失稳定性的条件。我们的结果展示了网络拓扑、标量权重和节点间变换如何共同塑造图案形成,并提供了一个分析和设计图灵图案的构造性框架,用于矩阵加权和高阶网络化系统。

英文摘要:

Diffusion-driven instability is a fundamental mechanism underlying pattern formation in spatially extended systems. In almost all existing works, diffusion across the links of the underlying network is modeled through scalar weights, possibly complemented by cross-diffusion terms that are homogeneous across links. In this work, we investigate the emergence of Turing patterns on Matrix Weighted Networks (MWNs), a recently introduced framework in which each edge is associated with a matrix weight. Focusing on the class of coherent MWNs, we provide a novel characterization of coherence in terms of node-dependent orthonormal matrices, showing that link transformations can be written as relative rotations between nodes. This representation allows us to deal with coherent MWNs of any size and to introduce an orthonormal change of variables capable to reduce diffusion on a coherent MWN to diffusion on a standard weighted network with scalar weights. Building on this, we extend the classical Turing instability analysis to MWNs and derive the conditions under which a homogeneous equilibrium of the local dynamics loses stability due to matrix-weighted diffusion. Moving beyond the dimensional constraints of previous approaches, our results show how network topology, scalar weights, and inter-node transformations jointly shape pattern formation, and provide a constructive framework to analyze and design Turing patterns on matrix-weighted and higher-order networked systems.

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

↑