Upper tail large deviation for the one-dimensional frog model

Van Hao Can, Naoki Kubota, Shuta Nakajima
{"title":"Upper tail large deviation for the one-dimensional frog model","authors":"Van Hao Can, Naoki Kubota, Shuta Nakajima","doi":"arxiv-2312.02745","DOIUrl":null,"url":null,"abstract":"In this paper, we study the upper tail large deviation for the\none-dimensional frog model. In this model, sleeping and active frogs are\nassigned to vertices on $\\mathbb Z$. While sleeping frogs do not move, the\nactive ones move as independent simple random walks and activate any sleeping\nfrogs. The main object of interest in this model is the asymptotic behavior of\nthe first passage time ${\\rm T}(0,n)$, which is the time needed to activate the\nfrog at the vertex $n$, assuming there is only one active frog at $0$ at the\nbeginning. While the law of large numbers and central limit theorems have been\nwell established, the intricacies of large deviations remain elusive. Using\nrenewal theory, B\\'erard and Ram\\'irez have pointed out a slowdown phenomenon\nwhere the probability that the first passage time ${\\rm T}(0,n)$ is\nsignificantly larger than its expectation decays sub-exponentially and lies\nbetween $\\exp(-n^{1/2+o(1)})$ and $\\exp(-n^{1/3+o(1)})$. In this article, using\na novel covering process approach, we confirm that $1/2$ is the correct\nexponent, i.e., the rate of upper large deviations is given by $n^{1/2}$.\nMoreover, we obtain an explicit rate function that is characterized by\nproperties of Brownian motion and is strictly concave.","PeriodicalId":501275,"journal":{"name":"arXiv - PHYS - Mathematical Physics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - PHYS - Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2312.02745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we study the upper tail large deviation for the one-dimensional frog model. In this model, sleeping and active frogs are assigned to vertices on $\mathbb Z$. While sleeping frogs do not move, the active ones move as independent simple random walks and activate any sleeping frogs. The main object of interest in this model is the asymptotic behavior of the first passage time ${\rm T}(0,n)$, which is the time needed to activate the frog at the vertex $n$, assuming there is only one active frog at $0$ at the beginning. While the law of large numbers and central limit theorems have been well established, the intricacies of large deviations remain elusive. Using renewal theory, B\'erard and Ram\'irez have pointed out a slowdown phenomenon where the probability that the first passage time ${\rm T}(0,n)$ is significantly larger than its expectation decays sub-exponentially and lies between $\exp(-n^{1/2+o(1)})$ and $\exp(-n^{1/3+o(1)})$. In this article, using a novel covering process approach, we confirm that $1/2$ is the correct exponent, i.e., the rate of upper large deviations is given by $n^{1/2}$. Moreover, we obtain an explicit rate function that is characterized by properties of Brownian motion and is strictly concave.
上尾偏差大,为一维青蛙模型
本文研究了一维青蛙模型的上尾大偏差问题。在这个模型中,睡眠青蛙和活动青蛙被分配到$\mathbb Z$上的顶点。虽然睡觉的青蛙不动,但活动的青蛙以独立的简单随机行走的方式移动,并激活任何睡觉的青蛙。这个模型的主要目标是第一次通过时间${\rm T}(0,n)$的渐近行为,这是在顶点$n$激活青蛙所需的时间,假设开始时$0$只有一只活动青蛙。虽然大数定律和中心极限定理已经很好地建立起来,但大偏差的复杂性仍然难以捉摸。利用更新理论,B\ erard和Ram\ irez指出了一种减速现象,其中第一次通过时间${\rm T}(0,n)$显著大于其期望的概率呈次指数衰减,并且位于$\exp(-n^{1/2+o(1)})$和$\exp(-n^{1/3+o(1)})$之间。在本文中,我们使用一种新颖的覆盖过程方法,证实了$1/2$是正确的指数,即上大偏差率由$n^{1/2}$给出。此外,我们还得到了一个具有布朗运动性质的严格凹的显式速率函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信