Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lotka-Volterra competition models on finite graphs (2209.13327v4)

Published 27 Sep 2022 in math.AP

Abstract: In this paper, we study three two competing species Lotka-Volterra competition models on finite connected graphs, with Dirichlet, Neumann or no boundary conditions. We get that when time goes to infinity, either one specie extincts while the other becomes surviving or both competing species coexist, which depend crucially on the strengh of species' competitiveness and the size of the initial population under the Neumann boundary condition and the condition that there is no boundary condition. One of our results partially answer a question posed by Slav\'{\i}k in [SIAM J. Appl. Dyn. Syst., 19 (2020)]. The critical techiniques in the proof of our main results are upper and lower solutions method, which are developed for weakly coupled parabolic systems on finite graphs in this article.

Summary

We haven't generated a summary for this paper yet.