๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Historicity of a Simple Competition Model

โœ Scribed by Yukihiko Toquenaga

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
169 KB
Volume
187
Category
Article
ISSN
0022-5193

No coin nor oath required. For personal study only.

โœฆ Synopsis

A Lotka-Volterra competition model was constructed to demonstrate historicity in community assemblage through competitive exclusion. Gilpin previously showed that if two five-species subcommunities have been self-organized through competitive exclusion, the resultant assemblage was dominated by either one of the subcommunities. I have extended his experiment and confirmed his results using two subcommunities consisting of three species as well as five species. Further experiments with two subcommunities of different sizes showed not only asymmetry but also a new feature that the smaller subcommunities tended to overcome the larger one.

๐Ÿ“œ SIMILAR VOLUMES

A simple competition model involving sel
A simple competition model involving selection
โœ F.G. Mosqueira ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Springer ๐ŸŒ English โš– 710 KB

A simple model system of two self-reproducing objects is considered. A set of equations, similar to Eigen's equations, describing competition of these objects is derived and analyzed under the effect of an 'ecological constraint'. The relation with other constraints used in the literature is discuss

Coexistence in a competition model
Coexistence in a competition model
โœ Xiaolong Luo; Haiyan Cai ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB
A Simple Competitive Graph Coloring Algo
A Simple Competitive Graph Coloring Algorithm
โœ H.A. Kierstead ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 157 KB

We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this resu