An Approach to Study Species Persistence in Unconstrained Random Networks
Bibliographic record
Abstract
The connection between structure and stability of ecological networks has been widely studied in the last fifty years. A challenge that scientists continue to face is that in-depth mathematical model analysis is often difficult, unless the considered systems are specifically constrained. This makes it challenging to generalize results. Therefore, methods are needed that relax the required restrictions. Here, we introduce a novel heuristic approach that provides persistence estimates for random systems without limiting the admissible parameter range and system behaviour. We apply our approach to study persistence of species in random generalized Lotka-Volterra systems and present simulation results, which confirm the accuracy of our predictions. Our results suggest that persistence is mainly driven by the linkage density, whereby additional links can both favour and hinder persistence. In particular, we observed "persistence bistability", a rarely studied feature of random networks, leading to a dependency of persistence on initial species densities. Networks with this property exhibit tipping points, in which species loss can lead to a cascade of extinctions. The methods developed in this paper may facilitate the study of more general models and thereby provide a step forward towards a unifying framework of network architecture and stability.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".