Cited by 22Mathematical and Theoretical Epidemiology and Ecology ModelsAdvanced Differential Equations and Dynamical SystemsNonlinear Dynamics and Pattern Formation

A Difference Equation Model for the Hypercycle

Hofbauer, Josef·1984·SIAM Journal on Applied Mathematics

Abstract

The paper presents a qualitative analysis of a system of n cyclically coupled difference equations $x'_i = x_i (C + k_i x_{i - 1} )(C + \Phi )^{ - 1} $ with $\Phi = \sum k_i x_i x_{i - 1} $, which may be viewed as a discrete analogue of the “hypercycle” differential equation $\dot x_i = x_i (k_i x_{i - 1} - \Phi )$. These equations are of particular interest in the theory of self-organization and biological evolution and have applications to the study of the social behaviour of animals.

Integrity signals

Registry

Crossref · 10.1137/0144054

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Assuming all catalytic rates same, hypercycles with 2,3,4 members have stable fixed point; with 5 or more approach stable limit cycle.

    “Assuming that all catalytic rates are the same, the dynamics leads to a stable fixed point for two-, three- and four-membered hypercycles [51,52]. Furthermore, if there are five or more members in the hypercycle, then the system approaches a stable limit cycle.”
  • Hypercycles with n ≤ 3 converge to stable fixed point; with five or more exhibit oscillatory behaviour; six or more can be unstable.

    “Again, hypercycles with n ≤ 3 members converge to a stable fixed point [51] and ones with five or more members exhibit oscillatory behaviour (stable limit cycles [57,58]. Hypercycles of six or more members can be unstable [59].”
  • In homogeneous hypercycle (Ai=0), all members coexist.

    “If for all i, Ai = 0, i.e., the replicators cannot replicate on their own, only with the help of another catalyst, then the system is fully cooperative and all members coexist [51,52,53,54,55,56].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Hofbauer, J.
Corresponding author
Hofbauer, Josef
Venue
SIAM Journal on Applied Mathematics
Published
1984-08
Volume
44
Issue
4
Pages
762-772
ISSN
  • 0036-1399 (ISSN-L)
  • 1095-712X
OpenAlex
W2029077390
Cited by
22
References
25
Citations by year
2024: 1 · 2022: 2 · 2020: 3 · 2019: 2 · 2017: 1 · 2014: 1
FWCI
4.85
Type
journal article
Language
en
Open access
closed
Locations
SIAM Journal on Applied Mathematics (publishedVersion)
Topics
  • Health Sciences › Medicine › Public Health, Environmental and Occupational Health › Mathematical and Theoretical Epidemiology and Ecology Models
  • Physical Sciences › Mathematics › Geometry and Topology › Advanced Differential Equations and Dynamical Systems
  • Physical Sciences › Computer Science › Computer Networks and Communications › Nonlinear Dynamics and Pattern Formation
Keywords
hypercycles, recurrence relations, self-organization, evolution, qualitative analysis, animal social behavior

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review