Predictable topological sensitivity of Turing patterns on graphs

Marc Thorsten Hütt, Dieter Armbruster, Annick Lesne

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Article number014304
JournalPhysical Review E
Volume105
Issue number1
DOIs
StatePublished - Jan 2022

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Fingerprint

Dive into the research topics of 'Predictable topological sensitivity of Turing patterns on graphs'. Together they form a unique fingerprint.

Cite this