Papers
Topics
Authors
Recent
Search
2000 character limit reached

Turing patterns on adaptive networks

Published 12 Sep 2025 in nlin.PS, cond-mat.stat-mech, math.DS, and nlin.AO | (2509.10124v1)

Abstract: We are surrounded by spatio-temporal patterns resulting from the interaction of the numerous basic units constituting natural or human-made systems. In presence of diffusive-like coupling, Turing theory has been largely applied to explain the formation of such self-organized motifs both on continuous domains or networked systems, where reactions occur in the nodes and the available links are used for species to diffuse. In many relevant applications, those links are not static, as very often assumed, but evolve in time and more importantly they adapt their weights to the states of the nodes. In this work, we make one step forward and we provide a general theory to prove the validity of Turing idea in the case of adaptive symmetric networks with positive weights. The conditions for the emergence of Turing instability rely on the spectral property of the Laplace matrix and the model parameters, thus strengthening the interplay between dynamics and network topology. A rich variety of patterns are presented by using two prototype models of nonlinear dynamical systems, the Brusselator and the FitzHugh-Nagumo model. Because many empirical networks adapt to changes in the system states, our results pave the way for a thorough understanding of self-organization in real-world systems.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.