Optimal conditions for first passage of jump processes with resetting.

IF 3.2 2区 数学 Q1 MATHEMATICS, APPLIED Chaos Pub Date : 2025-02-01 DOI:10.1063/5.0243875
Mattia Radice, Giampaolo Cristadoro, Samudrajit Thapa
{"title":"Optimal conditions for first passage of jump processes with resetting.","authors":"Mattia Radice, Giampaolo Cristadoro, Samudrajit Thapa","doi":"10.1063/5.0243875","DOIUrl":null,"url":null,"abstract":"<p><p>We investigate the first passage time beyond a barrier located at b≥0 of a random walk with independent and identically distributed jumps, starting from x0=0. The walk is subject to stochastic resetting, meaning that after each step the evolution is restarted with fixed probability r. We consider a resetting protocol that is an intermediate situation between a random walk (r=0) and an uncorrelated sequence of jumps all starting from the origin (r=1) and derive a general condition for determining when restarting the process with 0<r<1 is more efficient than restarting after each jump. If the mean first passage time of the process in the absence of resetting is larger than that of the sequence of jumps, this condition is sufficient to establish the existence of an optimal 0<r∗<1 that represents the best strategy, outperforming both r=0 and r=1. Our findings are discussed by considering two important examples of jump processes for which we draw the phase diagram illustrating the regions of the parameter space where resetting with some 0<r∗<1 is optimal.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 2","pages":""},"PeriodicalIF":3.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0243875","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We investigate the first passage time beyond a barrier located at b≥0 of a random walk with independent and identically distributed jumps, starting from x0=0. The walk is subject to stochastic resetting, meaning that after each step the evolution is restarted with fixed probability r. We consider a resetting protocol that is an intermediate situation between a random walk (r=0) and an uncorrelated sequence of jumps all starting from the origin (r=1) and derive a general condition for determining when restarting the process with 0

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带复位的跳跃过程第一次通过的最佳条件。
我们从x0=0开始,研究了具有独立和同分布跳跃的随机漫步在b≥0的障碍的第一次通过时间。行走服从随机重置,这意味着在每一步进化后以固定概率r重新开始。我们考虑一种重置协议,它是随机行走(r=0)和从原点(r=1)开始的不相关跳跃序列之间的中间情况,并推导出确定何时以0重新启动过程的一般条件
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Chaos
Chaos 物理-物理:数学物理
CiteScore
5.20
自引率
13.80%
发文量
448
审稿时长
2.3 months
期刊介绍: Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
期刊最新文献
A Bayesian framework for symmetry inference in chaotic attractors. Transient times and cycle-rich topology in reservoir computing. Noise-enhanced stickiness in the Harper map. Noise-induced transients in the propagation of epidemic with higher-order interactions. Introduction to Focus Issue: Nonautonomous dynamical systems: Theory, methods, and applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1