Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 42 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 34 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Connectivity properties of random interlacement and intersection of random walks (1012.4711v2)

Published 21 Dec 2010 in math.PR

Abstract: We consider the interlacement Poisson point process on the space of doubly-infinite Zd-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 random interlacement at level u of Sznitman arXiv:0704.2560 . We prove that for any u>0, almost surely, (1) any two vertices in the random interlacement at level u are connected via at most ceiling(d/2) trajectories of the point process, and (2) there are vertices in the random interlacement at level u which can only be connected via at least ceiling(d/2) trajectories of the point process. In particular, this implies the already known result of Sznitman arXiv:0704.2560 that the random interlacement at level u is connected.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.