pith. sign in

arxiv: 1102.4758 · v2 · pith:3ELGUBP3new · submitted 2011-02-23 · 🧮 math.PR

On the transience of random interlacements

classification 🧮 math.PR
keywords randomgraphinterlacementinterlacementstrajectoriesalmostarxivconsider
0
0 comments X
read the original abstract

We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least one of these trajectories is the graph induced by the random interlacements at level u of Sznitman arXiv:0704.2560. We prove that for any u>0, almost surely, the random interlacement graph is transient.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.