pith. sign in

arxiv: 1406.7742 · v1 · pith:YUPBP52Bnew · submitted 2014-06-30 · 🌊 nlin.AO

Bistable reaction-diffusion on a network

classification 🌊 nlin.AO
keywords bistabledependentdepinningnetworkreaction-diffusiontimeanalyticallyarbitrary
0
0 comments X
read the original abstract

We study analytically and numerically a bistable reaction-diffusion equation on an arbitrary finite network. We prove that stable fixed points (multi-fronts) exist for any configuration as long as the diffusion is small. We also study fold bifurcations leading to depinning and give a simple depinning criterion. These results are confirmed by using continuation techniques from bifurcation theory and by solving the time dependent problem near the treshold. A qualitative comparison principle is proved and verified for time dependent solutions, and for some related models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.