LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Predictable topological sensitivity of Turing patterns on graphs.

Photo from wikipedia

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… Click to show full 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.

Keywords: sensitivity turing; topological sensitivity; turing patterns; patterns graphs; predictable topological

Journal Title: Physical review. E
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.