2016
DOI: 10.1016/j.physa.2016.03.055
|View full text |Cite
|
Sign up to set email alerts
|

Turing instability in reaction–diffusion models on complex networks

Abstract: In this paper, the Turing instability in reaction-diffusion models defined on complex networks is studied. Here, we focus on three types of models which generate complex networks, i.e. the Erdős-Rényi, the Watts-Strogatz, and the threshold network models. From analysis of the Laplacian matrices of graphs generated by these models, we numerically reveal that stable and unstable regions of a homogeneous steady state on the parameter space of two diffusion coefficients completely differ, depending on the network … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
24
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(25 citation statements)
references
References 27 publications
0
24
1
Order By: Relevance
“… 2014 ; Ide et al. 2016 ; Nakao and Mikhailov 2010 ), and many of the aforementioned complex system geometries (Halatek and Frey 2012 ; Klünder et al. 2013 ; Halatek and Frey 2018 ).…”
Section: Introductionmentioning
confidence: 99%
“… 2014 ; Ide et al. 2016 ; Nakao and Mikhailov 2010 ), and many of the aforementioned complex system geometries (Halatek and Frey 2012 ; Klünder et al. 2013 ; Halatek and Frey 2018 ).…”
Section: Introductionmentioning
confidence: 99%
“…en, the Turing instability of the reaction-diffusion model defined on the complex network was studied in [19], and three types of models on the complex network were shown in the article. Numerical results showed that the uniform steady-state stability region depends on the network system's structure in the diffusion coefficient space.…”
Section: Introductionmentioning
confidence: 99%
“…Plane-wave driven Turing instability was studied on one and two dimensional lattices, where the wavefunctions and wave-numbers in continuous media are replaced by their discrete analogs corresponding to the eigenvalue and eigenvectors of the Laplacian matrix. In recent years, Turing patterns have been shown to exist in reaction-diffusion processes occurring on complex networks, where nodes in the graph are assigned an initial concentration of chemical species, and diffusion occurs along the edges connecting the nodes [12,13]. A small perturbation to the uniform state triggers the growth of Turing patterns above a critical threshold, corresponding to the ratio of the diffusion constants of the respective species.…”
Section: Introductionmentioning
confidence: 99%
“…A similar set of equations can be used if the system is not continuous but instead is composed of N independent nodes that interact via diffusive transport over m edges [12,14,22,37]. The analog of the operator ∇ 2 is now the Laplacian matrix,…”
Section: Introductionmentioning
confidence: 99%