2000 character limit reached
Bistable reaction-diffusion on a network
Published 30 Jun 2014 in nlin.AO | (1406.7742v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.