Biased Random Walks and Exclusion Processes on Random Graphs

随机图上的有偏随机游走和排除过程

• 批准号: 531531628
• 负责人: Professorin Dr. Nina Jael Gantert
• 金额: --
• 依托单位: Institut für Mathematik
• 依托单位国家: 德国
• 项目类别: Priority Programmes
• 资助国家: 德国
• 项目状态: 未结题
• 来源: https://gepris.dfg.de/gepris/projekt/531531628?language=en
• 关键词: Biased; Random; Walks; Exclusion; Processes

>We consider random spanning trees of ladder graphs or lattices, as well as point processes in d-dimensional space. They serve as random environments for biased random walks or exclusion processes. We plan to investigate (1) the speed of the random walk as a function of the bias; (2) the speed of the tagged particle in the exclusion process; (3) limit laws for the position of the walker or tagged particle, respectively. For spanning trees of integer lattices, we plan to consider "outwards biased'' random walks and study the same questions. We plan to investigate biased random walks on point processes, generalizing the one-dimensional results in earlier work by Faggionato, Gantert and Salvi to the multidimensional case.

>我们考虑梯形图或格的随机生成树，以及 d 维空间中的点过程。它们充当有偏差的随机游走或排除过程的随机环境。我们计划研究（1）随机游走的速度作为偏差的函数； (2)标记粒子在排除过程中的速度； (3) 分别针对步行者或标记粒子的位置的限制法则。对于整数格的生成树，我们计划考虑“向外偏置”随机游走并研究相同的问题。我们计划研究点过程上的偏置随机游走，将 Faggionato、Gantert 和 Salvi 早期工作中的一维结果推广到多维情况。