Qualitative analysis of a Lotka-Volterra competition system with advection
Bibliographic record
Abstract
We study a diffusive Lotka-Volterra competition system with advection under Neumann boundary conditions. Our system models a competition relationship that one species escape from the region of high population density of their competitors in order to avoid competition. We establish the global existence of bounded classical solutions to the system over one-dimensional finite domains. For multi-dimensional domains, globally bounded classical solutions are obtained for a parabolic-elliptic system under proper assumptions on the system parameters. These global existence results make it possible to study bounded steady states in order to model species segregation phenomenon. We then investigate the one-dimensional stationary problem. Through bifurcation theory, we obtain the existence of nonconstant positive steady states, which are small perturbations from the positive equilibrium; we also rigourously study the stability of these bifurcating solutions when diffusion coefficients of the escaper and its competitor are large and small respectively. In the limit of large advection rate, we show that the reaction-advection-diffusion system converges to a shadow system involving the competitor population density and an unknown positive constant. Existence and stability of positive nonconstant solutions to the shadow system have also been obtained through bifurcation theories. Finally, we construct infinitely many single interior transition layers to the shadow system when crowding rate of the escapers and diffusion rate of their interspecific competitors are sufficiently small. The transition-layer solutions can be used to model the interspecific segregation phenomenon.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".