Papers
Topics
Authors
Recent
Search
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.

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.