Martin T. Barlow, Takashi Kumagai
Let ${\cal G}$ be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree $n_0+1$. We obtain estimates for the transition density of the continuous time simple random walk $Y$ on ${\cal G}$; the process satisfies anomalous diffusion and has spectral dimension 4/3.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the random walk, which establish that the spectral dimension of the incipient infinite cluster is 4/3, and thereby prove a version of the Alexander--Orbach conjecture in this setting. The proof divides into two parts. One part establishes general estimates for simple random walk on an arbitrary infinite random graph, given suitable bounds on volume and effective resi…
We announce our recent proof that, for independent bond percolation in high dimensions, the scaling limits of the incipient infinite cluster's two-point and three-point functions are those of integrated super-Brownian excursion (ISE). The proof uses an extension of the lace expansion for percolation.
In dynamical critical site percolation on the triangular lattice or bond percolation on \Z^2, we define and study a local time measure on the exceptional times at which the origin is in an infinite cluster. We show that at a typical time with respect to this measure, the percolation configuration has the law of Kesten's Incipient Infinite Cluster. In the most technical result of this paper, we show that, on the other hand, at the first exceptional time, the law of the configuration is different. We also study the collapse of the infinite cluster near typical exceptional times, and establish a …
We study the Incipient Infinite Cluster (IIC) of high-dimensional bond percolation on $\mathbb{Z}^d$. We prove that the mass dimension of IIC almost surely equals $4$ and the volume growth exponent of IIC almost surely equals $2$.
We introduce the Incipient Infinite Cluster (IIC) in the critical Bernoulli site percolation model on the Uniform Infinite Half-Planar Triangulation (UIHPT), which is the local limit of large random triangulations with a boundary. The IIC is defined from the UIHPT by conditioning the open percolation cluster of the origin to be infinite. We prove that the IIC can be obtained by adding within the UIHPT an infinite triangulation with a boundary whose distribution is explicit.
We show that the electrical resistance between the origin and generation n of the incipient infinite oriented branching random walk in dimensions d<6 is O(n^{1-alpha}) for some universal constant alpha>0. This answers a question of Barlow, Járai, Kumagai and Slade [2].
We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at or near critical external fields. The incipient infinite cluster (IIC) measure in the sense of Kesten is constructed. As a consequence, we can obtain some geometric properties of IIC. The result holds also for the triangular lattice.
Consider bond percolation on the square lattice. Let ${\cal C}$ be the incipient infinite cluster with the incipient measure $ν$. If a one-arm path exponent exists and equals $5/48$, it is well known that $E_ν|{\cal C}\cup [-n,n]^2| = n^{ 91/48+o(1)}$. In this paper, we focus on the variance of $|{\cal C}\cup [-n,n]^2|$ and show that $σ^2_ν(|{\cal C}\cup [-n,n]^2|)= n^{91/24+o(1)}$.
The incipient infinite cluster of the FK-Ising model in dimensions $d\geq 3$ and the susceptibility of the high-dimensional Ising model
研究了FK-Ising模型在d≥3维度中的初始无限簇测度，并改进了高维Ising模型磁化率的渐进行为。
In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of Kesten's incipient infinite cluster. We show that our assumptions are satisfied if $G$ is a slab $\mathbb Z^2\times\{0,\ldots,k\}^{d-2}$ ($d\geq 2$, $k\geq 0$). We also argue that the quasi-multiplicativity assumption is fulfilled for $G=\mathbb Z^d$ if and only if $d<6$.
Robust construction of the incipient infinite cluster in high dimensional critical percolation
本文提出高维临界渗流 IIC 的新构造，借助超临界极限及连接任意远集条件，并基于两点函数渐近将其推广到所有已知适用维度。
In critical percolation models, in a large cube there will typically be more than one cluster of comparable diameter. In 2D, the probability of $k>>1$ spanning clusters is of the order $e^{-αk^{2}}$. In dimensions d>6, when $η= 0$ the spanning clusters proliferate: for $L\to \infty$ the spanning probability tends to one, and there typically are $ \approx L^{d-6}$ spanning clusters of size comparable to $|\C_{max}| \approx L^4$. The rigorous results confirm a generally accepted picture for d>6, but also correct some misconceptions concerning the uniqueness of the dominant cluster. We distinguis…
Bi-infinite incipient cluster in high dimensions
本文通过双重花边展开构造高维临界渗流的双无限初始簇，该极限测度局部类似临界渗流，却集中于两条互不相交的无限占据路径，并与已有初始无限簇相互奇异。
The incipient infinite cluster (IIC) measure is the percolation measure at criticality conditioned on the cluster of the origin to be infinite. Using the lace expansion, we construct the IIC measure for high-dimensional percolation models in three different ways, extending previous work by the second author and Jarai. We show that each construction yields the same measure, indicating that the IIC is a robust object. Furthermore, our constructions apply to spread-out versions of both finite-range and long-range percolation models. We also obtain estimates on structural properties of the IIC, su…
This note is motivated by results in arXiv:math/0608132 and arXiv:0806.2425 about global relations between the invasion percolation cluster (IPC) and the incipient infinite cluster (IIC) on regular trees and on two dimensional lattices, respectively. Namely, that the laws of the two objects are mutually singular, and, in the case of regular trees, that the IIC stochastically dominates the IPC. We prove that on two dimensional lattices, the IIC does not stochastically dominate the IPC. This is the first example showing that the relation between the IIC and IPC is significantly different on tree…
We consider critical percolation on Galton-Watson trees and prove quenched analogues of classical theorems of critical branching processes. We show that the probability critical percolation reaches depth $n$ is asymptotic to a tree-dependent constant times $n^{-1}$. Similarly, conditioned on critical percolation reaching depth $n$, the number of vertices at depth $n$ in the critical percolation cluster almost surely converges in distribution to an exponential random variable with mean depending only on the offspring distribution. The incipient infinite cluster (IIC) is constructed for a.e. Gal…
We construct a measure valued Markov process which we call infinite canonical super-Brownian motion, and which corresponds to the canonical measure of super-Brownian motion conditioned on non-extinction. Infinite canonical super-Brownian motion is a natural candidate for the scaling limit of various random branching objects on $\Z^d$ when these objects are (a) critical; (b) mean-field and (c) infinite. We prove that ICSBM is the scaling limit of the spread-out oriented percolation incipient infinite cluster above 4 dimensions and of incipient infinite branching random walk in any dimension. We…
We study the alternating $k$-arm incipient infinite cluster (IIC) of site percolation on the triangular lattice $\mathbb{T}$. Using Camia and Newman's result that the scaling limit of critical site percolation on $\mathbb{T}$ is CLE$_6$, we prove the existence of the scaling limit of the $k$-arm IIC for $k=1,2,4$. Conditioned on the event that there are open and closed arms connecting the origin to $\partial \mathbb{D}_R$, we show that the winding number variance of the arms is $(3/2+o(1))\log R$ as $R\rightarrow \infty$, which confirms a prediction of Wieland and Wilson (2003). Our proof uses…
We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the origin and the boundary of these Euclidean balls. We show that the geometric properties of long-range percolation clusters are significantly different from those of finite-range clusters. We also study the behavior of random walk on the backbone of the IIC and we prove that the Alexander-Orbach conjecture holds for the incipient infinite cluster in high dimensi…
We study invasion percolation in two dimensions, focusing on properties of the outlets of the invasion and their relation to critical percolation and to incipient infinite clusters (IIC's). First we compute the exact decay rate of the distribution of both the weight of the kth outlet and the volume of the kth pond. Next we prove bounds for all moments of the distribution of the number of outlets in an annulus. This result leads to almost sure bounds for the number of outlets in a box B(2^n) and for the decay rate of the weight of the kth outlet to p_c. We then prove existence of multiple-armed…
We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly trapped random walks (as defined in [BCČR15]) and thus describe these scaling limits as spatially subordinated Brownian motions
We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behavior of its $r$-point function for any $r\geq2$ and of its volume both at a given height and below a given height. We find that while the power laws of the scaling are the same as for the incipient infinite cluster for ordinary percolation, the scaling functions differ. Thus, somewhat surprisingly, the two clusters behave differently; in fact, we prove that their laws are mutually singular. In addition, we derive scaling estimates for simple random walk on the …
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and Quadrangulation and to the Incipient Infinite Cluster in $\mathbb{Z}^2$.
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z^2 by removing all horizontal edges off the X-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation in Z^2.
Kesten's incipient infinite cluster for the three-dimensional, metric-graph Gaussian free field, from critical level-set percolation, and for the Villain model, from random cluster geometries and a Swendsen-Wang type algorithm
本文通过采用Basu和Sapozhnikov的精简论证，解决了Ding-Wirth关于三维度量图高斯自由场水平集渗流的开放问题，成功构造了其Kesten初始无穷簇，并探讨了Dubedat-Falconet提出的Villain模型IIC型极限构造问题。
A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this property, and use it to prove that a critical Galton-Watson tree with finite variance conditioned to survive, the incipient infinite cluster in $\Z^d$ with $d \ge 19$ and the uniform spanning tree in $\Z^2$ all have the infinite collision property. For power-law combs and spherically symmetric trees, we determine precisely the phase boundary for the infinite coll…
Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical Galton--Watson tree conditioned to be large. We study simple random walk on these infinite looptrees by means of providing estimates on volume and resistance growth. We prove that if the offspring distribution of the Galton--Watson process is in the domain of attraction of a stable distribution with index $α\in(1,2]$ then the spectral dimension of the looptree is $2α/(α+…
We examine the incipient infinite cluster (IIC) of critical percolation in regimes where mean-field behavior has been established, namely when the dimension d is large enough or when d>6 and the lattice is sufficiently spread out. We find that random walk on the IIC exhibits anomalous diffusion with the spectral dimension d_s=4/3, that is, p_t(x,x)= t^{-2/3+o(1)}. This establishes a conjecture of Alexander and Orbach. En route we calculate the one-arm exponent with respect to the intrinsic distance.
We study invasion percolation on Aldous' Poisson-weighted infinite tree, and derive two distinct Markovian representations of the resulting process. One of these is the $σ\to\infty$ limit of a representation discovered by Angel et al. [Ann. Appl. Probab. 36 (2008) 420-466]. We also introduce an exploration process of a randomly weighted Poisson incipient infinite cluster. The dynamics of the new process are much more straightforward to describe than those of invasion percolation, but it turns out that the two processes have extremely similar behavior. Finally, we introduce two new "stationary"…
We show that random walk on the incipient infinite cluster (IIC) of two-dimensional critical percolation is subdiffusive in the chemical distance (i.e., in the intrinsic graph metric). Kesten (1986) famously showed that this is true for the Euclidean distance, but it is known that the chemical distance is typically asymptotically larger. More generally, we show that subdiffusivity in the chemical distance holds for stationary random graphs of polynomial volume growth, as long as there is a multi-scale way of covering the graph so that "deep patches" have "thin backbones". Our estimates are qua…
Two-sided infinite self-avoiding walk in high dimensions
本文在 d≥5 的 Z^d 上构造双侧无限自回避行走，证明其是单侧无限 SAW 的平移极限和有限 SAW 的尺寸极限，并利用模式定理、耦合遍历性及路径计数渐近给出无限 SAW 存在性的新证明。
We consider a stationary and ergodic random field {ω(b)} parameterized by the family of bonds b in Z^d, d>1. The random variable ω(b) is thought of as the conductance of bond b and it ranges in a finite interval [0,c_0]. Assuming that the set of bonds with positive conductance has a unique infinite cluster C, we prove homogenization results for the random walk among random conductances on C. As a byproduct, applying the general criterion of \cite{F} leading to the hydrodynamic limit of exclusion processes with bond-dependent transition rates, for almost all realizations of the environment we p…
Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller Markov process. The dynamical correlation functions of the limit process are determinantal with an explicit correlation kernel. The key idea is to identify random point processes on Z with q-Gibbs measures on Gelfand-Tsetlin schemes and construct Markov processes on the latter space. Independently, we analyze the large time behavior of PushASEP with finitely ma…
Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs
本文证明在度量图上，除临界维度外，高斯自由场和环环汤的四种初始无限簇存在且等价，并揭示临界簇体积增长指数，支持其标度极限猜想。
On the intersection of critical percolation clusters and other tree-like random graphs
该研究针对两个或多个独立树状随机图的交集性质展开，覆盖临界渗流簇等场景，在两点函数最小假设下得到交点数的精确超额偏差界，证明依赖n点函数新界及分支随机游走局部时联合矩。
Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on $Z^d$ where $d \ge 2$. The first new result is a type of uniqueness theorem: for every pair $x$ and $y$ of vertices which lie in infinite open paths, there exists almost surely a third vertex $z$ which is joined to infinity and which is attainable from $x$ and $y$ along directed open paths. Secondly, it is proved that a random walk on an infinite directed clust…
We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to that of non-degenerate, isotropic Brownian motion. Our analysis is based on the consideration of a harmonic deformation of the infinite cluster on which the random walk becomes a square-integrable martingale. The size of the deformation, expressed by the so called corrector, is estimated by means of ergodicity arguments.
Elephant random walks on infinite Cayley trees
本文将Schütz和Trimper的大象随机游走推广到有限生成群，研究Cayley树的非交换群的渐近速度，发现速度与记忆参数无关，且存在相变点。
We derive "quenched" subdiffusive lower bounds for the exit time tau(n) from a box of size n for the simple random walk on the planar invasion percolation cluster. The first part of the paper is devoted to proving an almost sure analog of H. Kesten's subdiffusivity theorem for the random walk on the incipient infinite cluster and the invasion percolation cluster using ideas of M. Aizenman, A. Burchard and A. Pisztora. The proof combines lower bounds on the instrinsic distance in these graphs and general inequalities for reversible Markov chains. In the second part of the paper, we present a sh…
We study the trace of the incipient infinite oriented branching random walk in $\mathbb{Z}^d \times \mathbb{Z}_+$ when the dimension is $d = 6$. Under suitable moment assumptions, we show that the electrical resistance between the root and level $n$ is $O(n \log^{-ξ}n )$ for a $ξ> 0$ that does not depend on details of the model.
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution corresponding to a Lévy subordinator with infinite mass at 0. We show that, under suitable conditions, the empirical spectral distribution of the random transition matrix associated to the RWRC converges weakly, as N goes to infinity, to a symmetric deterministic measure on [-1,1], in probability with respect to the randomness of the conductances. In short time scal…
In this article, we study linearly edge-reinforced random walk on general multi-level ladders for large initial edge weights. For infinite ladders, we show that the process can be represented as a random walk in a random environment, given by random weights on the edges. The edge weights decay exponentially in space. The process converges to a stationary process. We provide asymptotic bounds for the range of the random walker up to a given time, showing that it localizes much more than an ordinary random walker. The random environment is described in terms of an infinite-volume Gibbs measure.
Let Z_N be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Z^d with parameter p>p_c(Z^d). The object of this paper is to study the connective constant of the dilute lattice \limsup_{N\to \infty} Z_N^{1/N}, which is a non-random quantity. We want to investigate if the inequality \limsup_{N\to \infty} (Z_N)^{1/N} \le \lim_{N\to \infty} E[Z_N]^{1/N} obtained with the Borel-Cantelli Lemma is strict or not. In other words, we want to know the the quenched and annealed versions of the connective constan…
We study invasion percolation in two dimensions. We compare connectivity properties of the origin's invaded region to those of (a) the critical percolation cluster of the origin and (b) the incipient infinite cluster. To exhibit similarities, we show that for any $k\geq1$, the $k$-point function of the first so-called pond has the same asymptotic behavior as the probability that $k$ points are in the critical cluster of the origin. More prominent, though, are the differences. We show that there are infinitely many ponds that contain many large disjoint $p_c$-open clusters. Further, for $k>1$, …
We consider a class of biased random walks on infinite graphs and present several general results on the spectral radius of biased random walk.
This paper surveys the results of recent collaborations with Eric Derbez and with Takashi Hara, which show that intergrated super-Brownian excursion (ISE) arises as the scaling limit of both lattice trees and the incipient infinite percolation cluster, in high dimensions. A potential extension to oriented percolation is also mentioned.
Wildberger gave a method to construct a finite hermitian discrete hypergroup from a random walk on a certain kind of graphs. In this article, we reveal that his method is applicable to a random walk on a certain kind of infinite graphs. Moreover, we make some observations of finite or infinite graphs on which a random walk produces a hermitian discrete hypergroup.
This paper is concerned with the continuous-time quantum walk on Z, Z^d, and infinite homogeneous trees. By using the generating function method, we compute the limit of the average probability distribution for the general isotropic walk on Z, and for nearest-neighbor walks on Z^d and infinite homogeneous trees. In addition, we compute the asymptotic approximation for the probability of the return to zero at time t in all these cases.
We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the environment viewed from the random walker as derived by Berger and Biskup.
Elephant random walk on the infinite dihedral group $\mathbb{Z}_2 * \mathbb{Z}_2$
研究无限二面体群$\mathbb{Z}_2 * \mathbb{Z}_2}$上的象形随机游走，发现其具有与简单随机游走相同的渐进行为，但记忆参数影响收敛速度。
In this paper, we give some sufficient conditions for the infinite collisions of independent simple random walks on a wedge comb with profile $\{f(n), n\in \ZZ\}$. One interesting result is that if $f(n)$ has a growth order as $n\log n$, then two independent simple random walks on the wedge comb will collide infinitely many times. Another is that if $\{f(n); n\in \ZZ\}$ are given by i.i.d. non-negative random variables with finite mean, then for almost all wedge comb with such profile, three independent simple random walks on it will collide infinitely many times.
The loop-erased random walk (LERW) in $ \Z^d, d \geq 2$, is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the "middle" of the path.
Biased random walk on a locally infinite Galton-Watson tree
本文提出一种在具有无限度顶点的Galton-Watson树上的有偏随机游走变体，利用再生结构研究速度的可微性与单调性，并证明其为局部有限树上速度的极限。
We consider a random walk on a second countable locally compact topological space endowed with an invariant Radon measure. We show that if the walk is symmetric and if every subset which is invariant by the walk has zero or infinite measure, then one has escape of mass for almost every starting point. We then apply this result in the context of homogeneous random walks on infinite volume spaces, and deduce a converse to Eskin-Margulis recurrence theorem.
The infinite two-sided loop-erased random walk (LERW) is a measure on infinite self-avoiding walks that can be viewed as giving the law of the `middle part' of an infinite LERW loop going through 0 and infinity. In this note we derive expressions for transition probabilities for this model in dimensions two and up. In the plane, the formula can be further expressed in terms of a Laplacian with signed weights acting on certain discrete harmonic functions at the tips of the walk, and taking a determinant. The discrete harmonic functions are closely related to a discrete version of the complex sq…
We consider Pólya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on the offset distribution. This improves results by Bandyopadhyay and Thacker (2014--2017; convergence in probability), and Mailler and Marckert (2017; a.s. convergence assuming exponential moment).
We consider a one-dimensional recurrent random walk in random environment (RWRE). We show that the - suitably centered - empirical distributions of the RWRE converge weakly to a certain limit law which describes the stationary distribution of a random walk in an infinite valley. The construction of the infinite valley goes back to Golosov. As a consequence, we show weak convergence for both the maximal local time and the self-intersection local time of the RWRE and also determine the exact constant in the almost sure upper limit of the maximal local time.
We study the pioneer points of the simple random walk on the uniform infinite planar quadrangulation (UIPQ) using an adaptation of the peeling procedure of Angel to the quadrangulation case. Our main result is that, up to polylogarithmic factors, $n^3$ pioneer points have been discovered before the walk exits the ball of radius $n$ in the UIPQ. As a result we verify the KPZ relation in the particular case of the pioneer exponent and prove that the walk is subdiffusive with exponent less than 1/3. Along the way, new geometric controls on the UIPQ are established.
Let $ξ_1,ξ_2,\ldots$ be independent, identically distributed random variables with infinite mean $\mathbf E[|ξ_1|]=\infty.$ Consider a random walk $S_n=ξ_1+\cdots+ξ_n$, a stopping time $τ=\min\{n\ge 1: S_n\le 0\}$ and let $M_τ=\max_{0\le i\le τ} S_i$. We study the asymptotics for $\mathbf P(M_τ>x),$ as $x\to\infty$.
For a one-dimensional simple random walk $(S_t)$, for each time $t$ we say a site $x$ is a favorite site if it has the maximal local time. In this paper, we show that with probability 1 three favorite sites occurs infinitely often. Our work is inspired by Tóth (2001), and disproves a conjecture of Erdös and Révész (1984) and of Tóth (2001).
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。