Predictable topological sensitivity of Turing patterns on graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Physical Review E Année : 2022

Predictable topological sensitivity of Turing patterns on graphs

Résumé

Reaction-diffusion systems implemented as dynamical processes on networks have recently renewed the interest in their self-organized collective patterns known as Turing patterns. We investigate the influence of network topology on the emerging patterns and their diversity, defined as the variety of stationary states observed with random initial conditions and the same dynamics. We show that a seemingly minor change, the removal or rewiring of a single link, can prompt dramatic changes in pattern diversity. The determinants of such critical occurrences are explored through an extensive and systematic set of numerical experiments. We identify situations where the topological sensitivity of the attractor landscape can be predicted without a full simulation of the dynamical equations, from the spectrum of the graph Laplacian and the linearized dynamics. Unexpectedly, the main determinant appears to be the degeneracy of the eigenvalues or the growth rate and not the number of unstable modes.
Fichier principal
Vignette du fichier
Hütt et al. - 2022 - Predictable topological sensitivity of Turing patt.pdf (3.37 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03557705 , version 1 (04-02-2022)

Identifiants

Citer

Marc-Thorsten Hütt, Dieter Armbruster, Annick Lesne. Predictable topological sensitivity of Turing patterns on graphs. Physical Review E , 2022, 105 (1), pp.014304. ⟨10.1103/PhysRevE.105.014304⟩. ⟨hal-03557705⟩
28 Consultations
189 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More