Bigraphs and Dynamics of Lotka–Volterra Mapping Trajectories on a Four-Dimensional Simplex $$\boldsymbol{\Delta^{4}}$$

2025

Closed access Metadata (CSL-JSON)
DOI 10.1134/s199508022561183x
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Abstract In this paper, the dynamic properties of the Lotka–Volterra mapping are investigated, the matrix of which is determined by a complete oriented bigraph. Previously, such Lotka–Volterra mappings were not considered. In the framework of these mappings, criteria for trajectory convergence and the associated pathways of positive and negative trajectories are determined. It is shown that, in some degenerate cases, it is possible not only to establish conditions for the convergence of trajectories but also to determine the beginning and end of the evolution of any trajectory. The discrete mappings studied in this paper can act as a discrete compartmental model divided into three groups and including viruses that replicate only in the presence of other viruses.