有限种群进化对策中固定概率的Bernstein多项式逼近

IF 1.8 4区 数学 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Jiyeon Park, Paul K. Newton
{"title":"有限种群进化对策中固定概率的Bernstein多项式逼近","authors":"Jiyeon Park, Paul K. Newton","doi":"10.1007/s13235-023-00509-8","DOIUrl":null,"url":null,"abstract":"We use the Bernstein polynomials of degree d as the basis for constructing a uniform approximation to the rate of evolution (related to the fixation probability) of a species in a two-component finite-population, well-mixed, frequency-dependent evolutionary game setting. The approximation is valid over the full range $$0 \\le w \\le 1$$ , where w is the selection pressure parameter, and converges uniformly to the exact solution as $$d \\rightarrow \\infty $$ . We compare it to a widely used non-uniform approximation formula in the weak-selection limit ( $$w \\sim 0$$ ) as well as numerically computed values of the exact solution. Because of a boundary layer that occurs in the weak-selection limit, the Bernstein polynomial method is more efficient at approximating the rate of evolution in the strong selection region ( $$w \\sim 1$$ ) (requiring the use of fewer modes to obtain the same level of accuracy) than in the weak selection regime.","PeriodicalId":48933,"journal":{"name":"Dynamic Games and Applications","volume":"181 1","pages":"0"},"PeriodicalIF":1.8000,"publicationDate":"2023-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bernstein Polynomial Approximation of Fixation Probability in Finite Population Evolutionary Games\",\"authors\":\"Jiyeon Park, Paul K. Newton\",\"doi\":\"10.1007/s13235-023-00509-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We use the Bernstein polynomials of degree d as the basis for constructing a uniform approximation to the rate of evolution (related to the fixation probability) of a species in a two-component finite-population, well-mixed, frequency-dependent evolutionary game setting. The approximation is valid over the full range $$0 \\\\le w \\\\le 1$$ , where w is the selection pressure parameter, and converges uniformly to the exact solution as $$d \\\\rightarrow \\\\infty $$ . We compare it to a widely used non-uniform approximation formula in the weak-selection limit ( $$w \\\\sim 0$$ ) as well as numerically computed values of the exact solution. Because of a boundary layer that occurs in the weak-selection limit, the Bernstein polynomial method is more efficient at approximating the rate of evolution in the strong selection region ( $$w \\\\sim 1$$ ) (requiring the use of fewer modes to obtain the same level of accuracy) than in the weak selection regime.\",\"PeriodicalId\":48933,\"journal\":{\"name\":\"Dynamic Games and Applications\",\"volume\":\"181 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Dynamic Games and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s13235-023-00509-8\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dynamic Games and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s13235-023-00509-8","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

我们使用d度的Bernstein多项式作为在双组分有限种群、混合良好、频率依赖的进化博弈设置中构建物种进化速率(与固定概率相关)的统一近似的基础。该近似在整个范围内都是有效的$$0 \le w \le 1$$,其中w是选择压力参数,并均匀收敛到精确解$$d \rightarrow \infty $$。我们将其与在弱选择极限($$w \sim 0$$)中广泛使用的非均匀近似公式以及精确解的数值计算值进行比较。由于在弱选择极限中存在边界层,伯恩斯坦多项式方法在强选择区域($$w \sim 1$$)(需要使用更少的模式来获得相同的精度水平)中近似进化速率比在弱选择区域更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bernstein Polynomial Approximation of Fixation Probability in Finite Population Evolutionary Games
We use the Bernstein polynomials of degree d as the basis for constructing a uniform approximation to the rate of evolution (related to the fixation probability) of a species in a two-component finite-population, well-mixed, frequency-dependent evolutionary game setting. The approximation is valid over the full range $$0 \le w \le 1$$ , where w is the selection pressure parameter, and converges uniformly to the exact solution as $$d \rightarrow \infty $$ . We compare it to a widely used non-uniform approximation formula in the weak-selection limit ( $$w \sim 0$$ ) as well as numerically computed values of the exact solution. Because of a boundary layer that occurs in the weak-selection limit, the Bernstein polynomial method is more efficient at approximating the rate of evolution in the strong selection region ( $$w \sim 1$$ ) (requiring the use of fewer modes to obtain the same level of accuracy) than in the weak selection regime.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Dynamic Games and Applications
Dynamic Games and Applications MATHEMATICS, INTERDISCIPLINARY APPLICATIONS-
CiteScore
3.20
自引率
13.30%
发文量
67
期刊介绍: Dynamic Games and Applications is devoted to the development of all classes of dynamic games, namely, differential games, discrete-time dynamic games, evolutionary games, repeated and stochastic games, and their applications in all fields
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信