2014
DOI: 10.1007/978-3-662-44140-4_1
|View full text |Cite
|
Sign up to set email alerts
|

Competitive Exclusion Through Discrete Time Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(12 citation statements)
references
References 31 publications
0
12
0
Order By: Relevance
“…Now we return to the model given by (1). We assume that f : R k + → [0, 1] is a continuous function which satisfies (3).…”
Section: Applicationsmentioning
confidence: 99%
See 4 more Smart Citations
“…Now we return to the model given by (1). We assume that f : R k + → [0, 1] is a continuous function which satisfies (3).…”
Section: Applicationsmentioning
confidence: 99%
“…In particular, the model given by (1) can exhibit chaotic behaviour if the suppression function is of the form f (x) = 1 − x 1 − · · · − x n , i.e., it is a generalization of the logistic model.…”
Section: 2mentioning
confidence: 99%
See 3 more Smart Citations