Traveling and pinned fronts in bistable reaction-diffusion systems on network

Abstract

Traveling fronts and stationary localized patterns in bistable reaction-diffusion systems have been broadly studied for classical continuous media and regular lattices. Analogs of such non-equilibrium patterns are also possible in networks. Here, we consider traveling and stationary patterns in bistable one-component systems on random Erdös-Rényi, scale-free and hierarchical tree networks. As revealed through numerical simulations, traveling fronts exist in network-organized systems. They represent waves of transition from one stable state into another, spreading over the entire network. The fronts can furthermore be pinned, thus forming stationary structures. While pinning of fronts has previously been considered for chains of diffusively coupled bistable elements, the network architecture brings about significant differences. An important role is played by the degree (the number of connections) of a node. For regular trees with a fixed branching factor, the pinning conditions are analytically determined. For large Erdös-Rényi and scale-free networks, the mean-field theory for stationary patterns is constructed.

References in corpus (4)

• Prediction and predictability of global epidemics: the role of the airline transportation network
• Reaction-diffusion processes and metapopulation models in heterogeneous networks
• Turing patterns in network-organized activator-inhibitor systems
• Diffusion-induced instability and chaos in random oscillator networks

Cited by in corpus (2)

• Pattern Formation on Networks with Reactions: A Continuous Time Random Walk Approach
• Feedback-induced stationary localized patterns in networks of diffusively coupled bistable elements