Jiří Černý, Serguei Popov
We prove a shape theorem for the internal (graph) distance on the interlacement set $\mathcal{I}^u$ of the random interlacement model on $\mathbb Z^d$, $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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we study geometric properties of the unique infinite cluster $Γ$ in a sufficiently supercritical Finitary Random Interlacements $\mathcal{FI}^{u,T}$ in $\mathbb{Z}^d, \ d\ge 3$. We prove that the chemical distance in $Γ$ is, with stretched exponentially high probability, of the same order as the Euclidean distance in $\mathbb{Z}^d$. This also implies a shape theorem parallel to those for Bernoulli percolation and random interlacements. We also prove local uniqueness of $\mathcal{FI}^{u,T}$, which says any two large clusters in $\mathcal{FI}^{u,T}$ "close to each other" will with…
In $\mathbb{Z}^d$ with $d\ge 5$, we consider the time constant $ρ_u$ associated to the chemical distance in random interlacements at low intensity $u \ll 1$. We prove an upper bound of order $u^{-1/2}$ and a lower bound of order $u^{-1/2+\varepsilon}$. The upper bound agrees with the conjectured scale in which $u^{1/2}ρ_u$ converges to a constant multiple of the Euclidean norm, as $u\to 0$. Along the proof, we obtain a local lower bound on the chemical distance between the boundaries of two concentric boxes, which might be of independent interest. For both upper and lower bounds, the paper emp…
Visibility in Brownain interlacements, Poisson cylinders and Boolean models
本文研究了Brownian interlacements等三种模型空置集内的可见性，获得了距离r可见性概率的精确渐近界，发现在$d\geq4$维度下三者标度一致，并改进了已有文献的主要结果。
On the shape of the connected components of the complement of two-dimensional Brownian random interlacements
本文研究二维布朗随机交织空位集连通分量的极限形状，证明在小距离条件下其分布逼近重新标度的布朗阿米巴，并构造了一族新的条件布朗运动鞅。
Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices visited by the walk. Distance and mixing bounds for the typical range are proven that are a $k$-iterated log factor from those on the full torus for arbitrary $k$. The proof uses hierarchical renormalization and techniques that can possibly be applied to other random processes in the Euclidean lattice. We use the same technique to bound the heat kernel of a ra…
First passage percolation, local uniqueness for interlacements and capacity of random walk
本文研究了随机交错模型的首达渗流，给出了FPP距离与图距离可比概率的渐近锐下界，并在低维情形下将其应用于局部唯一性和随机游走容量的锐大偏差界。
On the visibility window for Brownian interlacements, Poisson cylinders and Boolean models
本文研究了 $\mathbb R^d$ 中三种空间相关性缓慢衰减模型的空缺集内部可见性，证明了在给定可见条件下，最大可见球半径与可见性窗口之比弱收敛于显式强度的指数分布。
In this paper we establish a decoupling feature of the random interlacement process I^u in Z^d, at level u, for d \geq 3. Roughly speaking, we show that observations of I^u restricted to two disjoint subsets A_1 and A_2 of Z^d are approximately independent, once we add a sprinkling to the process I^u by slightly increasing the parameter u. Our results differ from previous ones in that we allow the mutual distance between the sets A_1 and A_2 to be much smaller than their diameters. We then provide an important application of this decoupling for which such flexibility is crucial. More precisely…
On the maximum visibility in a ball through the vacant set of Poissonian obstacles
本文研究三种障碍物模型中球内最大可见距离，证明其除以特定对数因子后依概率收敛于显式常数，并给出维度3时布朗交错的修正因子。
In this paper we provide general conditions on a one parameter family of random infinite subsets of Z^d to contain a unique infinite connected component for which the chemical distances are comparable to the Euclidean distances, focusing primarily on models with long-range correlations. Our results are in the spirit of those by Antal and Pisztora proved for Bernoulli percolation. We also prove a shape theorem for balls in the chemical distance under such conditions. Our general statements give novel results about the structure of the infinite connected component of the vacant set of random int…
Sharp connectivity bounds for the vacant set of random interlacements
研究三维及以上空间中随机交织空置集在强度u下的渗流，推导截断两点函数的下界，在三维及高维非临界情形达到指数阶最优，并揭示临界标度极限的欧几里得不变性。
Multi-hop visibility through the vacant set of Poissonian obstacles
该研究针对d维欧几里得空间中三种不同障碍物模型的空集，推导了多跳可见性概率的精确界，观察到其在两个特征尺度上的普适行为，推广了早期针对单跳的相关结果。
First passage percolation with long-range correlations and applications to random Schrödinger operators
本文研究长程相关环境中的首次通过渗流，证明时间常数为正、距离可比及形状定理，并将结果用于随机电导模型的热核上界与 Green 函数衰减估计。
The Internal Diffusion Limited Aggregation has been introduced by Diaconis and Fulton in 1991. It is a growth model defined on an infinite set and associated to a Markov chain on this set. We focus here on sets which are finitely generated groups with exponential growth. We prove a shape theorem for the Internal DLA on such groups associated to symmetric random walks. For that purpose, we introduce a new distance associated to the Green function, which happens to have some interesting properties. In the case of homogeneous trees, we also get the right order for the fluctuations of that model a…
The random split tree introduced by Devroye (1999) is considered. We derive a second order expansion for the mean of its internal path length and furthermore obtain a limit law by the contraction method. As an assumption we need the splitter having a Lebesgue density and mass in every neighborhood of 1. We use properly stopped homogeneous Markov chains, for which limit results in total variation distance as well as renewal theory are used. Furthermore, we extend this method to obtain the corresponding results for the Wiener index.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。