Spatial invasion of cooperative parasites

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2024-07-09 DOI:10.1016/j.tpb.2024.07.001

{"title":"Spatial invasion of cooperative parasites","authors":"","doi":"10.1016/j.tpb.2024.07.001","DOIUrl":null,"url":null,"abstract":"<div>In this paper we study invasion probabilities and invasion times of cooperative parasites spreading in spatially structured host populations. The spatial structure of the host population is given by a random geometric graph on <math><msup><mrow><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow><mrow><mi>n</mi></mrow></msup></math>, <math><mrow><mi>n</mi><mo>∈</mo><mi>N</mi></mrow></math>, with a Poisson<math><mrow><mo>(</mo><mi>N</mi><mo>)</mo></mrow></math>-distributed number of vertices and in which vertices are connected over an edge when they have a distance of at most <math><msub><mrow><mi>r</mi></mrow><mrow><mi>N</mi></mrow></msub></math> with <math><msub><mrow><mi>r</mi></mrow><mrow><mi>N</mi></mrow></msub></math> of order <math><msup><mrow><mi>N</mi></mrow><mrow><mrow><mo>(</mo><mi>β</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mo>/</mo><mi>n</mi></mrow></msup></math> for some <math><mrow><mn>0</mn><mo><</mo><mi>β</mi><mo><</mo><mn>1</mn></mrow></math>. At a host infection many parasites are generated and parasites move along edges to neighbouring hosts. We assume that parasites have to cooperate to infect hosts, in the sense that at least two parasites need to attack a host simultaneously. We find lower and upper bounds on the invasion probability of the parasites in terms of survival probabilities of branching processes with cooperation. Furthermore, we characterize the asymptotic invasion time.An important ingredient of the proofs is a comparison with infection dynamics of cooperative parasites in host populations structured according to a complete graph, i.e. in well-mixed host populations. For these infection processes we can show that invasion probabilities are asymptotically equal to survival probabilities of branching processes with cooperation. Furthermore, we build on proof techniques developed in Brouard and Pokalyuk (2022), where an analogous invasion process has been studied for host populations structured according to a configuration model.We substantiate our results with simulations.</div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0040580924000686/pdfft?md5=7baf961ab53e2f51f9344de949b836db&pid=1-s2.0-S0040580924000686-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"99","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0040580924000686","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

Abstract

In this paper we study invasion probabilities and invasion times of cooperative parasites spreading in spatially structured host populations. The spatial structure of the host population is given by a random geometric graph on ${[0, 1]}^{n}$ , $n \in N$ , with a Poisson $(N)$ -distributed number of vertices and in which vertices are connected over an edge when they have a distance of at most $r_{N}$ with $r_{N}$ of order $N^{(β - 1) / n}$ for some $0 < β < 1$ . At a host infection many parasites are generated and parasites move along edges to neighbouring hosts. We assume that parasites have to cooperate to infect hosts, in the sense that at least two parasites need to attack a host simultaneously. We find lower and upper bounds on the invasion probability of the parasites in terms of survival probabilities of branching processes with cooperation. Furthermore, we characterize the asymptotic invasion time.

An important ingredient of the proofs is a comparison with infection dynamics of cooperative parasites in host populations structured according to a complete graph, i.e. in well-mixed host populations. For these infection processes we can show that invasion probabilities are asymptotically equal to survival probabilities of branching processes with cooperation. Furthermore, we build on proof techniques developed in Brouard and Pokalyuk (2022), where an analogous invasion process has been studied for host populations structured according to a configuration model.

We substantiate our results with simulations.

查看原文本刊更多论文

合作寄生虫的空间入侵。

本文研究了在空间结构宿主种群中传播的合作寄生虫的入侵概率和入侵时间。宿主种群的空间结构由[0,1]n, n∈N 上的随机几何图给出，图中顶点的数量是泊松（N）分布的，当顶点之间的距离最多为 rN 时，它们通过边相连，rN 的阶数为 N(β-1)/n，对于某个 0

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.