Vegué Marina, Thibeault Vincent, Desrosiers Patrick, Allard Antoine
Département de physique, de génie physique et d'optique, Université Laval, 2325 rue de l'Université, G1V 0A6 Québec, Canada.
Centre interdisciplinaire en modélisation mathématique, Université Laval, 2325 rue de l'Université, G1V 0A6 Québec, Canada.
PNAS Nexus. 2023 May 2;2(5):pgad150. doi: 10.1093/pnasnexus/pgad150. eCollection 2023 May.
Dimension reduction is a common strategy to study nonlinear dynamical systems composed by a large number of variables. The goal is to find a smaller version of the system whose time evolution is easier to predict while preserving some of the key dynamical features of the original system. Finding such a reduced representation for complex systems is, however, a difficult task. We address this problem for dynamics on weighted directed networks, with special emphasis on modular and heterogeneous networks. We propose a two-step dimension-reduction method that takes into account the properties of the adjacency matrix. First, units are partitioned into groups of similar connectivity profiles. Each group is associated to an observable that is a weighted average of the nodes' activities within the group. Second, we derive a set of equations that must be fulfilled for these observables to properly represent the original system's behavior, together with a method for approximately solving them. The result is a reduced adjacency matrix and an approximate system of ODEs for the observables' evolution. We show that the reduced system can be used to predict some characteristic features of the complete dynamics for different types of connectivity structures, both synthetic and derived from real data, including neuronal, ecological, and social networks. Our formalism opens a way to a systematic comparison of the effect of various structural properties on the overall network dynamics. It can thus help to identify the main structural driving forces guiding the evolution of dynamical processes on networks.
降维是研究由大量变量组成的非线性动力系统的常用策略。目标是找到该系统的一个较小版本,其时间演化更容易预测,同时保留原始系统的一些关键动力学特征。然而,为复杂系统找到这样一种简化表示是一项艰巨的任务。我们针对加权有向网络上的动力学解决这个问题,特别关注模块化和异质网络。我们提出一种两步降维方法,该方法考虑了邻接矩阵的性质。首先,将单元划分为具有相似连接配置文件的组。每个组与一个可观测量相关联,该可观测量是组内节点活动的加权平均值。其次,我们推导了一组方程,这些可观测量必须满足这些方程才能正确表示原始系统的行为,同时还推导了一种近似求解这些方程的方法。结果是一个简化的邻接矩阵和一个用于可观测量演化的近似常微分方程组。我们表明,简化后的系统可用于预测不同类型连接结构(包括合成的和从真实数据导出的,如神经元、生态和社会网络)完整动力学的一些特征。我们的形式主义为系统比较各种结构特性对整体网络动力学的影响开辟了一条途径。因此,它有助于识别指导网络上动力学过程演化的主要结构驱动力。