2000 character limit reached
On the internal distance in the interlacement set
Published 16 Nov 2011 in math.PR | (1111.3979v2)
Abstract: We prove a shape theorem for the internal (graph) distance on the interlacement set $\mathcal{I}u$ of the random interlacement model on $\mathbb Zd$, $d\ge 3$. We provide large deviation estimates for the internal distance of distant points in this set, and use these estimates to study the internal distance on the range of a simple random walk on a discrete torus.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.