Amir Dembo, Alain-Sol Sznitman
We study the asymptotic behavior for large N of the disconnection time T_N of simple random walk on a discrete cylinder with base a d-dimensional discrete torus of side-length N. When d is sufficiently large, we are able to substantially improve the lower bounds obtained by the authors in a previous article when d is bigger or equal to 2. We show here that the laws of N^(2d)/T_N are tight.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We investigate the disconnection time of a simple random walk in a discrete cylinder with a large finite connected base. In a recent article of A. Dembo and the author it was found that for large $N$ the disconnection time of $G_N\times\mathbb{Z}$ has rough order $|G_N|^2$, when $G_N=(\mathbb{Z}/N\mathbb{Z})^d$. In agreement with a conjecture by I. Benjamini, we show here that this behavior has broad generality when the bases of the discrete cylinders are large connected graphs of uniformly bounded degree.
We consider a random walk on the discrete cylinder $({\mathbb{Z}}/N{\mathbb{Z}})^d\times{\mathbb{Z}}$, $d\geq3$ with drift $N^{-dα}$ in the $\mathbb{Z}$-direction and investigate the large $N$-behavior of the disconnection time $T^{\mathrm{disc}}_N$, defined as the first time when the trajectory of the random walk disconnects the cylinder into two infinite components. We prove that, as long as the drift exponent $α$ is strictly greater than 1, the asymptotic behavior of $T^{\mathrm{disc}}_N$ remains $N^{2d+o(1)}$, as in the unbiased case considered by Dembo and Sznitman, whereas for $α<1$, the…
Sharp asymptotics of disconnection time of large cylinders by simple and biased random walks
本文研究了简单与有偏随机游走对大离散圆柱体的渐近断开时间，推导出匹配的精确下界并改进了有偏游走的界，同时提出了随机游走迹与随机交织间的强耦合工具。
We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random interlacements on $\mathbb{Z}^{d+1}$ recently introduced in [Ann. Math., in press], and specifically with the percolative properties of the vacant set left by random interlacements. As an application we show that in the large $N$ limit the tail of $T_N/N^{2d}$ is dominated by the tail of the first time when the supremum over the space variable of the Brownian…
We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of side-length almost of order N, at certain random times comparable to the square of the number of sites in the base. We show a domination control in terms of the trace left in similar boxes by random interlacements in the infinite (d+1)-dimensional cubic lattice at a suitably adjusted level. As an application we derive a lower bound on the disconnection time of the …
We derive asymptotic upper and lower bounds on the large deviation probability that the level set of the Gaussian free field on $Z^d$, d bigger or equal to three, below a given level disconnects the discrete blow-up of a compact set A from the boundary of the discrete blow-up of a box that contains A, when the level set of the Gaussian free field above this level is in a strongly percolative regime. These bounds substantially strengthen the results of arXiv:1412.3960, where A was a box and the convexity of A played an important role in the proof. We also derive an asymptotic upper bound on the…
We investigate percolation of the vacant set of random interlacements on $\mathbb{Z}^d$, $d\geq 3$, in the strongly percolative regime. We consider the event that the interlacement set at level $u$ disconnects the discrete blow-up of a compact set $A\subseteq \mathbb{R}^d$ from the boundary of an enclosing box. We derive asymptotic large deviation upper bounds on the probability that the local averages of the occupation times deviate from a specific function depending on the harmonic potential of $A$, when disconnection occurs. If certain critical levels coincide, which is plausible but open a…
We study level-set percolation for the harmonic crystal on $\mathbb{Z}^d$, $d \geq 3$, with uniformly elliptic random conductances. We prove that this model undergoes a non-trivial phase transition at a critical level that is almost surely constant under the environment measure. Moreover, we study the disconnection event that the level-set of this field below a level $α$ disconnects the discrete blow-up of a compact set $A \subseteq \mathbb{R}^d$ from the boundary of an enclosing box. We obtain quenched asymptotic upper and lower bounds on its probability in terms of the homogenized capacity o…
In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian motion starting in the compact set. As an application of our results, we substantially strengthen the results of arXiv:1412.3960, and obtain when $d \ge 3$, large deviation upper bounds on the probability that simple random walk in $Z^d$, or random interlacements in $Z^d$, when their vacant set is in a strongly percolative regime, disconnect the discrete blow-u…
We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of random interlacements recently introduced in arXiv:0704.2560. In particular we show that when the base becomes large, in the neighborhood of a point of the cylinder with a vertical component of order N^d, the complement of the set of points visited by the walk up to times of order N^{2d}, is close in distribution to the law of the vacant set of random interla…
This article proves that, in terms of local times, the rescaled and recentered cover times of finite subsets of the discrete cylinder by simple random walk converge in law to the Gumbel distribution, as the cardinality of the set goes to infinity. As applications we obtain several other results related to covering in the discrete cylinder. Our method is new and involves random interlacements, which were introduced by Sznitman in arXiv:0704.2560. To enable the proof we develop a new stronger coupling of simple random walk in the cylinder and random interlacements, which is also of independent i…
We prove existence of intersection exponents xi(k,lambda) for biased random walks on d-dimensional half-infinite discrete cylinders, and show that, as functions of lambda, these exponents are real analytic. As part of the argument, we prove convergence to stationarity of a time-inhomogeneous Markov chain on half-infinite random paths. Furthermore, we show this convergence takes place at exponential rate, an estimate obtained via a coupling of weighted half-infinite paths.
We consider the DLA process on a cylinder G x N. It is shown that this process "grows arms", provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most (log|G|)^(2-\eps), the time it takes the cluster to reach the m-th layer of the cylinder is at most of order m |G|/loglog|G|. In particular we get examples of infinite Cayley graphs of degree 5, for which the DLA cluster on these graphs has arbitrarily small density. In addition, we provide an upper bound on the rate at which the "arms" grow. This bound is valid for a large class of base graphs…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the large N limit the microscopic structure in the bulk, which arises when considering the disconnection time of a discrete cylinder with base a d-1-dimensional discrete torus of side-length N, or the set of points visited by simple random walk on the d-dimensional discrete torus of side-length N by times of order uN^d. We study the percolative properties of the …
We use the periodic Schur process, introduced in arXiv:math/0601019v1, to study the random height function of lozenge tilings (equivalently, dimers) on an infinite cylinder distributed under two variants of the $q^{\operatorname{vol}}$ measure. Under the first variant, corresponding to random cylindric partitions, the height function converges to a deterministic limit shape and fluctuations around it are given by the Gaussian free field in the conformal structure predicted by the Kenyon-Okounkov conjecture. Under the second variant, corresponding to an unrestricted dimer model on the cylinder,…
Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is a large finite connected weighted graph, and relate it to the model of random interlacements on infinite transient weighted graphs. Under suitable assumptions, the set of points not visited by the random walk until a time of order |G_N|^2 in a neighborhood of a point with Z-component of order |G_N| converges in distribution to the law of the vacant set of a random interlacement on a certain limit model describing the…
In this paper we deal with the classical problem of random cover times. We investigate the distribution of the time it takes for a Poisson process of cylinders to cover a set $A \subset \mathbb{R}^d.$ This Poisson process of cylinders is invariant under rotations, reflections and translations, and in addition we add a time component so that cylinders are "raining from the sky" at unit rate. Our main results concerns the asymptotic of this cover time as the set $A$ grows. If the set $A$ is discrete and well separated, we show convergence of the cover time to a Gumbel distribution. If instead $A…
Gaussian fluctuations for Internal DLA on cylinders
研究圆柱体上内部DLA的波动特性，证明其平均波动收敛于GFF，并改进了集群最大波动的界，推导出该几何下IDLA的形状定理。
We consider the standard first passage percolation model on $\mathbb Z^ d$ with a distribution $G$ taking two values $0<a<b$. We study the maximal flow through the cylinder $[0,n]^ {d-1}\times [0,hn]$ between its top and bottom as well as its associated minimal surface(s). We prove that the variance of the maximal flow is superconcentrated, i.e. in $O(\frac {n^{d-1}} {\log n})$, for $h\geq h_0$ (for a large enough constant $h_0=h_0(a,b)$). Equivalently, we obtain that the ground state energy of a disordered Ising ferromagnet in a cylinder $[0,n]^ {d-1}\times [0,hn]$ is superconcentrated when o…
Internal DLA is a discrete model of a moving interface. On the cylinder graph $\mathbb{Z}_N \times \mathbb{Z}$, a particle starts uniformly on $\mathbb{Z}_N \times \{0\}$ and performs simple random walk on the cylinder until reaching an unoccupied site in $\mathbb{Z}_N \times \mathbb{Z}_{\geq 0}$, which it occupies forever. This operation defines a Markov chain on subsets of the cylinder. We first show that a typical subset is rectangular with at most logarithmic fluctuations. We use this to prove that two Internal DLA chains started from different typical subsets can be coupled with high prob…
In first-passage percolation, one assigns i.i.d. nonnegative weights $(t_e)$ to the edges of $\mathbb{Z}^d$ and studies the induced distance (passage time) $T(x,y)$ between vertices $x$ and $y$. It is known that for $d=2$, the fluctuations of $T(x,y)$ are at least order $\sqrt{\log |x-y|}$ under mild assumptions on $t_e$. We study the question of fluctuation lower bounds for $T_n$, the minimal passage time between two opposite sides of an $n$ by $n$ square. The main result is that, under a curvature assumption, this quantity has fluctuations at least of order $n^{1/8-ε}$ for any $ε>0$ when the…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。