Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems
Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems
复制标题
DOI：
10.1080/10236198.2015.1125895
复制
发表时间：
2016-05
影响因子：
1.1
通讯作者：
S. Baigent
中科院分区：
文献类型：
--
作者：
S. Baigent
我们考虑离散时间竞争柯尔莫哥洛夫系统的承载单纯形的几何结构。提出了基于哈达玛图变换的承载单纯形的存在定理，并确定了变换产生凸图或凹图序列的条件。作为应用，表明平面 Leslie-Gower 模型具有凸形或凹形的承载单纯形。
We consider the geometry of carrying simplices of discrete-time competitive Kolmogorov systems. An existence theorem for the carrying simplex based upon the Hadamard graph transform is developed, and conditions for when the transform yields a sequence of convex or concave graphs are determined. As an application it is shown that the planar Leslie–Gower model has a carrying simplex that is convex or concave.