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

An improved decoupling inequality for random interlacements (1809.05594v2)

Published 14 Sep 2018 in math.PR

Abstract: In this paper we obtain a decoupling feature of the random interlacements process $\mathcal{I}u \subset \mathbb{Z}d$, at level $u$, $d\geq 3$. More precisely, we show that the trace of the random interlacements process on two disjoint finite sets, $\textsf{F}$ and its translated $\textsf{F}+x$, can be coupled with high probability of success, when $|x|$ is large, with the trace of a process of independent excursions, which we call the noodle soup process. As a consequence, we obtain an upper bound on the covariance between two $[0,1]$-valued functions depending on the configuration of the random interlacements on $\textsf{F}$ and $\textsf{F}+x$, respectively. This improves a previous bound obtained by Sznitman in [12].

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.