2020
DOI: 10.1088/1361-6544/abb03c
|View full text |Cite
|
Sign up to set email alerts
|

On existence and uniqueness of a carrying simplex in Kolmogorov differential systems

Abstract: For a C 1 map T from C = [0, +∞) N to C of the form Ti(x) = xifi(x), the dynamical system x(n) = T n (x) as a population model is competitive if ∂f i ∂x j ≤ 0 (i = j). A well know theorem for competitive systems, presented by Hirsch (J. Bio. Dyn. 2 (2008) 169-179) and proved by Ruiz-Herrera (J. Differ. Equ. Appl. 19 (2013) 96-113) with various versions by others, states that, under certain conditions, the system has a compact invariant surface Σ ⊂ C that is homeomorphic to ∆ N−1 = {x ∈ C : x1 + • • • + xN = 1}… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 49 publications
1
6
0
Order By: Relevance
“…Then, by Theorem 2.4, we have α(p) = {0} so p ∈ B(0), a contradiction to p ∈ Σ = B(0) \ ({0} ∪ B(0)). This shows our claim (13).…”
Section: Criteria For Dominance and Vanishing Speciessupporting
confidence: 77%
See 2 more Smart Citations
“…Then, by Theorem 2.4, we have α(p) = {0} so p ∈ B(0), a contradiction to p ∈ Σ = B(0) \ ({0} ∪ B(0)). This shows our claim (13).…”
Section: Criteria For Dominance and Vanishing Speciessupporting
confidence: 77%
“…(a) Under the assumption that Γ i ∩ [0, r] is strictly below Γ j for all j ∈ I N \ {i}, we first claim that (13) were not true then we would have a point p ∈ (Γ − i ∩ Σ). As 0 ∈ Σ, we have p = 0 and a nonempty…”
Section: Criteria For Dominance and Vanishing Speciesmentioning
confidence: 99%
See 1 more Smart Citation
“…The carrying simplex theory and its various applications is one of the important and influential developments. This theory was originally established by Hirsch [10] (see [13] and [14] for latest update) for competitive Kolmogorov systems of differential equations. Since then the idea of a carrying simplex for discrete systems gradually appeared in literature (see [20], [21], [16], [5] for example).…”
Section: Carrying Simplex Of Competitive Kolmogorov Mapsmentioning
confidence: 99%
“…This can be thought of as modelling competition for resources. In differential equation models for competition, these assumptions are typically sufficient for a carrying simplex to exist [8,11], but not in the discrete time case. We follow other authors [23,9,20,12] and add further conditions that render the map retrotone.…”
Section: Introductionmentioning
confidence: 99%