arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2609.16956math.PR

具有多项式衰减步长的遗忘型大象随机游走

Amnesic Elephant Random Walk with Polynomially Decaying Step Sizes

Shyan Ghosh, Manisha Dhillon, Kuldeep Kumar Kataria

首次发表
浏览论文内容

中文总结 AI 辅助

本文提出具有多项式衰减步长的遗忘型大象随机游走,研究步长指数与记忆参数对长期行为的影响,确定了两个临界阈值,并揭示了亚扩散、经典扩散及局域化等不同相态。

中文摘要 AI 辅助

本文提出了一种具有多项式衰减步长的遗忘型大象随机游走。该游走保留了遗忘型大象随机游走的记忆丧失效应,但其步长随时间呈多项式衰减。我们研究了步长指数和记忆参数对游走长期行为的影响。确定了决定其相图的两个临界阈值。我们获得了游走在不同参数区域下的几乎必然收敛结果、重对数律、渐近正态性和均方位移速率。步长的多项式衰减导致出现亚扩散区域,而在无衰减时恢复经典扩散。此外,我们确定了游走几乎必然收敛到有限随机变量的局域化区域。

英文摘要

In this paper, we introduce an amnesic elephant random walk with polynomially decaying step sizes. The walk retains the loss of memory effect of amnesic ERW, however its step sizes decay polynomially over time. We study the effect of step-size exponent and memory parameter on the long-time behaviour of the walk. Two critical thresholds are identified that determine its phase diagram. We obtain almost sure convergence results, law of iterated logarithm, asymptotic normality and mean square displacement rate of the walk across different parameter regimes. The polynomial decay of step sizes gives rise to a subdiffusive regime while classical diffusion is recovered in the absence of decay. Also, we identify localization regimes in which the walk converges almost surely to a finite random variable.

发表机构

  • Indian Institute of Technology Bhilai(印度理工学院比莱分校)

机构由 AI 辅助整理,请以论文原文为准。

↑