Itai Benjamini, Ori Gurel-Gurevich
It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of Pólya's Recurrence Theorem \cite{6}. Second, we prove a \emph{local almost sure central limit theorem} for (not necessarly lattice) random walks in the line or in the plane, which will also give us quantitative recurrence results. Finally, we prove an \emph{almost sure central limit theorem} for multidimensional (not necessarly lattice) random walks. This i…
We consider Sinai's random walk in random environment. We prove that infinitely often (i.o.) the size of the concentration neighborhood of this random walk is almost surely bounded. As an application we get that i.o. the maximal distance between two favorite sites is almost surely bounded.
We study the winding behavior of random walks on two oriented square lattices. One common feature of these walks is that they are bound to revolve clockwise. We also obtain quantitative results of transience/recurrence for each walk.
We consider a random walk on $\R^d$ in a polynomially mixing random environment that is refreshed at each time step. We use a martingale approach to give a necessary and sufficient condition for the almost-sure functional central limit theorem to hold.
We continue our study of critical branching random walk and branching capacity. In this paper we introduce branching recurrence and branching transience and prove an analogous version of Wiener's Test.
We consider recurrence versus transience for models of random walks on domains of $\mathbb{Z}^d$, in which monotone interaction enforces domain growth as a result of visits by the walk (or probes it sent), to the neighborhood of domain boundary.
For normally reflected Brownian motion and for simple random walk on independently growing in time d-dimensional domains, d>=3, we establish a sharp criterion for recurrence versus transience in terms of the growth rate.
In this note, we prove without using Fourier analysis that the symmetric square integrable random walks in $\Z^{2}$ are recurrent.
We establish recurrence and transience criteria for critical branching processes in random environment with immigration. These results are then applied to discuss recurrence and transience of a recurrent random walk in a random environment on Z that will be disturbed by cookies inducing a drift to the right of strength 1.
We consider a non-nestling random walk in a product random environment. We assume an exponential moment for the step of the walk, uniformly in the environment. We prove an invariance principle (functional central limit theorem) under almost every environment for the centered and diffusively scaled walk. The main point behind the invariance principle is that the quenched mean of the walk behaves subdiffusively.
Recurrence of the plane Elephant random walk
本文通过与标准平面随机游走进行粗略比较，给出了扩散状态下二维大象随机游走常返性的简短证明，并期望该方法可推广至其他问题。
We study linearly edge-reinforced random walks on $\mathbb{Z}_+$, where each edge $\{x,x+1\}$ has the initial weight $x^α \vee 1$, and each time an edge is traversed, its weight is increased by $Δ$. It is known that the walk is recurrent if and only if $α\leq 1$. The aim of this paper is to study the almost sure behavior of the walk in the recurrent regime. For $α<1$ and $Δ>0$, we obtain a limit theorem which is a counterpart of the law of the iterated logarithm for simple random walks. This reveals that the speed of the walk with $Δ>0$ is much slower than $Δ=0$. In the critical case $α=1$, ou…
We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence $w$ satisfying $w(k) = o(k^α)$ for some $α< 1/2$ is recurrent. This improves on previous results of Volkov (2006) and Schapira (2012).
We investigate excited random walks on $\Z^d, d\ge 1,$ and on planar strips $\Z\times\{0,1,...,L-1\}$ which have a drift in a given direction. The strength of the drift may depend on a random i.i.d. environment and on the local time of the walk. We give exact criteria for recurrence and transience, thus generalizing results by Benjamini and Wilson for once-excited random walk on $\Z^d$ and by the author for multi-excited random walk on $\Z$.
The notion of degree and related notions concerning recurrence and transience for a class of L'evy processes on metric Abelian groups are studied. The case of random walks on a hierarchical group is examined with emphasis on the role of the ultrametric structure of the group and on analogies and differences with Euclidean random walks. Applications to separation of time scales and occupation times of multilevel branching systems are discussed.
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random; the resulting random walk is then a tree-valued random walk in random environment. We investigate the recurrent case, and prove, under suitable general integrability assumptions, that upon the system's non-extinction, the maximal displacement of the walk in the first n steps, divided by (log n)^3, converges almost surely to a known positive constant.
Consider a real-valued branching random walk in the boundary case. Using the techniques developed by Aïdékon and Shi [5], we give two integral tests which describe respectively the lower limits for the minimal position and the upper limits for the associated additive martingale.
We consider a multidimensional random walk in a product random environment with bounded steps, transience in some spatial direction, and high enough moments on the regeneration time. We prove an invariance principle, or functional central limit theorem, under almost every environment for the diffusively scaled centered walk. The main point behind the invariance principle is that the quenched mean of the walk behaves subdiffusively.
Let $(Y_n)$ be a sequence of i.i.d. real valued random variables. Reflected random walk $(X_n)$ is defined recursively by $X_0=x \ge 0$, $X_{n+1} = |X_n - Y_{n+1}|$. In this note, we study recurrence of this process, extending a previous criterion. This is obtained by determining an invariant measure of the embedded process of reflections.
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze to prove recurrence for a large class of such processes, including all "invertible" walks in elliptic random environments. Furthermore, rewriting our Newtonian walks as ordinary random walks in a suitable graph, we gain a better idea of the geometric features of the problem, and obtain further examples of recurrence.
In this paper, we investigate the properties of recurrent planar Markov random walks. More precisely, we study the set of recurrent points with the use of local limit theorems. The Nagaev-Guivarc'h spectral method provides several examples for which these local limit theorems are satisfied as soon as the (standard or non-standard) central limit theorem holds.
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{é}vy walks for which the persistence times depend on some internal Markov chain: they admit Markov random walk skeletons. A recurrence versus transience dichotomy is highlighted. We first give a sufficient Fourier criterion for the recurrence, close to the usual Chung-Fuchs one, assuming in addition the positive recurrence of the driving chain and a series criterion is derived. The key tool is the Nagaev-Guivarc'h method. Fina…
We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This classification is stated explicitly for BRWRE on $\Z^d.$ Furthermore, we emphasize the interplay between Branching Markov Chains and the spectral radius. We prove properties of the spectral radius of the Random Walk in Random Environment with the help of appropriate Branching Markov Chains.
In this paper we show that given a circle packing of an infinite planar triangulation such that its carrier is parabolic, placing weights on the edges according to a certain natural way introduced by Dubejko, makes the random walk recurrent. We also propose a higher-dimensional analogue of the Dubejko weights.
We consider the branching random walks in $d$-dimensional integer lattice with time--space i.i.d. offspring distributions. Then the normalization of the total population is a nonnegative martingale and it almost surely converges to a certain random variable. When $d\geq3$ and the fluctuation of environment satisfies a certain uniform square integrability then it is nondegenerate and we prove a central limit theorem for the density of the population in terms of almost sure convergence.
We study a particular class of trace-preserving completely positive maps, called PQ-channels, for which classical and quantum evolutions are isolated in a certain sense. By combining open quantum random walks with a notion of recurrence, we are able to describe criteria for recurrence of the walk related to this class of channels. Positive recurrence for open walks is also discussed in this context.
We study random walks on the integers mod $G_n$ that are determined by an integer sequence $\{ G_n \}_{n \geq 1}$ generated by a linear recurrence relation. Fourier analysis provides explicit formulas to compute the eigenvalues of the transition matrices and we use this to bound the mixing time of the random walks.
We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the recurrence/transience property of the walk. In particular, we prove that the asymptotic behavior of the walk depends on the order of the excitations, which contrasts with the one dimensional setting studied by Zerner (2005). We also consider the limiting speed of the walk in the transient regime and conjecture that it is not a monotonic function of the environment.
In the proof of the invariance principle for locally perturbed periodic Lorentz process with finite horizon, a lot of delicate results were needed concerning the recurrence properties of its unperturbed version. These were analogous to the similar properties of Simple Symmetric Random Walk. However, in the case of Lorentz process with infinite horizon, the analogous results for the corresponding random walk are not known, either. In this paper, these properties are ascertained for the appropriate random walk (this happens to be in the non normal domain of attraction of the normal law). As a to…
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and the jump rate function. For recurrent models we obtain almost sure estimates on effective resistances in finite boxes. For transient models we construct explicit fluxes with finite energy on the associated electrical network.
Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that {S_n(t)} returns to the origin infinitely often. In this paper we consider a dynamical random walk on Z^2. We show that with probability one there exists t such that {S_n(t)} never returns to the origin. This exceptional set of times has dimension one. This proves a conjecture of Benjamini et. al.
We survey distributional properties of $\mathbb{R}^d$-valued cocycles of finite measure preserving ergodic transformations (or, equivalently, of stationary random walks in $\mathbb{R}^d$) which determine recurrence or transience.
Let $(G,ρ)$ be a stationary random graph, and use $B^G_ρ(r)$ to denote the ball of radius $r$ about $ρ$ in $G$. Suppose that $(G,ρ)$ has annealed polynomial growth, in the sense that $\mathbb{E}[|B^G_ρ(r)|] \leq O(r^k)$ for some $k > 0$ and every $r \geq 1$. Then there is an infinite sequence of times $\{t_n\}$ at which the random walk $\{X_t\}$ on $(G,ρ)$ is at most diffusive: Almost surely (over the choice of $(G,ρ)$), there is a number $C > 0$ such that \[ \mathbb{E} \left[\mathrm{dist}_G(X_0, X_{t_n})^2 \mid X_0 = ρ, (G,ρ)\right]\leq C t_n\qquad \forall n \geq 1\,. \] This result is new ev…
Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is relaxed, this is no longer true. We study a family of zero-drift spatially non-homogeneous random walks (Markov processes) whose increment covariance matrix is asymptotically constant along rays from the origin, and which, in any ambient dimension $d \geq 2$, can be adjusted so that the walk is either transient or recurrent. Natural examples are provided by rand…
We provide sufficient conditions which ensure that the intrinsic martingale in the supercritical branching random walk converges exponentially fast to its limit. The case of Galton-Watson processes is particularly included so that our results can be seen as a generalization of a result given in the classical treatise by Asmussen and Hering. As an auxiliary tool, we prove ultimate versions of two results concerning the exponential renewal measures which may be interesting on its own and which correct, generalize and simplify some earlier works.
This paper has been withdrawn by the author due to a mistake in one of the main lemmas.
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for Galton-Watson trees whose offspring distribution has exponential tail. We prove bounds on the occupation probability of a site, as well as a general 0-1 law. Similar conclusions hold for a coalescing process on trees where particles do not backtrack.
Consider a simple random walk on the integers with the following transition mechanism. At each site $x$, the probability of jumping to the right is $ω(x)\in[\frac12,1)$, until the first time the process jumps to the left from site $x$, from which time onward the probability of jumping to the right is $\frac12$. We investigate the transience/recurrence properties of this process in both deterministic and stationary, ergodic environments $\{ω(x)\}_{x\in Z}$. In deterministic environments, we also study the speed of the process.
This work is motivated by the study of some two-dimensional random walks in random environment (RWRE) with transition probabilities independent of one coordinate of the walk. These are non-reversible models and can not be treated by electrical network techniques. The proof of the recurrence of such RWRE needs new estimates for quenched return probabilities of a one-dimensional recurrent RWRE. We obtained these estimates by constructing suitable valleys for the potential. They imply that k independent walkers in the same one-dimensional (recurrent) environment will meet in the origin infinitely…
We give a short proof of Theorem 2.1 from [MR07], stating that the linearly edge reinforced random walk (ERRW) on a locally finite graph is recurrent if and only if it returns to its starting point almost surely. This result was proved in [MR07] by means of the much stronger property that the law of the ERRW is a mixture of Markov chains. Our proof only uses this latter property on finite graphs, in which case it is a consequence of De Finetti's theorem on exchangeability.
We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and conductances, we show that, for almost any realization of the point process, these random walks are recurrent if $d=2$ and transient if $d\geq 3$. These results hold for a large variety of point processes including Poisson point processes, Mat{é}rn cluster and Mat{é}rn hardcore processes which have clustering or repulsive properties. In order to prove them, we…
For a symmetric random walk in $Z^2$ with $2+δ$ moments, we represent $|\mathcal{R}(n)|$, the cardinality of the range, in terms of an expansion involving the renormalized intersection local times of a Brownian motion. We show that for each $k\geq 1$ \[ (\log n)^k [ \frac{1}{n} |\mathcal{R}(n)| +\sum_{j=1}^k (-1)^j (\textstyle{\frac1{2π}}\log n +c_X)^{-j} γ_{j,n}]\to 0, \qquad a.s. \] where $W_t$ is a Brownian motion, $W^{(n)}_t=W_{nt}/\sqrt n$, $γ_{j,n}$ is the renormalized intersection local time at time 1 for $W^{(n)}$, and $c_X$ is a constant depending on the distribution of the random wal…
We prove the annealed Central Limit Theorem for random walks in bistochastic random environments on $Z^d$ with zero local drift. The proof is based on a "dynamicist's interpretation" of the system, and requires a much weaker condition than the customary uniform ellipticity. Moreover, recurrence is derived for $d \le 2$.
The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and attached to the current position of the walker. These processes share similarities with other important classes of markovian and non-markovian random walks presenting a large variety of behaviors according to parameters specifications. We show that for a large and most significant class of tree builder random walks, the process is either null recurrent or trans…
We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process is alpha-mixing and of finite second moment, then the twisted random walk is recurrent for every angle fixed choice of the angle out of a set of full Lebesgue measure, no matter how slow the mixing coefficients decay.
We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are their applications to multiple recurrence for stochastic processes and dynamical systems.
We study the problem of site recurrence of discrete time nearest neighbor open quantum random walks (OQWs) on the integer line, proving basic properties and some of its relations with the corresponding problem for unitary (coined) quantum walks (UQWs). For both kinds of walks our discussion concerns two notions of recurrence, one given by a monitoring procedure, another in terms of Pólya numbers, and we study their similarities and differences. In particular, by considering UQWs and OQWs induced by the same pair of matrices, we discuss the fact that recurrence of these walks are related by an …
We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many linear groups over local fields supports a recurrent random walk if and only if it has at most quadratic growth. We give also a detailed analysis of ergodicity properties for special classes of random walks on homogeneous spaces. The structure of closed subgroups of linear groups over local fields and the properties of group actions with respect to stationary me…
In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call a random walk 'polygonally recurrent' (resp. transient) if a.s. infinitely many (resp. finitely many) of the straight lines between two consecutive sites hit a given bounded set. The above estimate implies that three-dimensional random walks with independent components are polygonally transient. Similarly a directionally reinforced random walk on Z^3 in the…
We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite planar triangulation and quadrangulation (UIPT and UIPQ) are almost surely recurrent, resolving a conjecture of Angel, Benjamini and Schramm. We also settle another related problem of Benjamini and Schramm. We show that in any bounded degree, finite planar graph the probability that the simple random walk started at a uniform random vertex avoids its initial location for T steps is at most C/log T.
The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent one-dimensional Poisson processes placed on two intersecting lines and prove that the greedy walk almost surely does not visit all points. When a point process is defined on two parallel lines, the result depends on the definition of the process: If each line has a copy of the same realisation of a homogeneous Poisson point process, then the walk almost surely doe…
We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in series. We prove that the linearly edge-reinforced random walk on these graphs is recurrent. Furthermore, we derive bounds for the probability that the edge-reinforced random walk hits the boundary of a large box before returning to its starting point.
Recurrence and range of the balanced excited random walk M(2,1,2)
本文证明平面平衡激发随机游走 M(2,1,2) 常返，其访问范围极限与平面简单随机游走相同，并推广至空间非均匀饼干环境。
An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes
该研究针对生长图上随机游走（RWoGG）模型，证明了k叉生长树、无限增长n维超立方体等图上的随机游走的常返性与暂留性会随图生长速度发生相变，还引入LHaGG概念通过耦合论证完成证明。
Conditions for recurrence and transience for time-inhomogeneous random walks
本文扩展了Abramov关于时间非齐次生灭过程的结果至时间非齐次随机游走，完整解决了Menshikov和Volkov提出的开放问题。
This is the third in a series of papers in which we consider one-dimensional Random Walk in Cooling Random Environment (RWCRE). The latter is obtained by starting from one-dimensional Random Walk in Random Environment (RWRE) and resampling the environment along a sequence of deterministic times, called refreshing times. In the present paper we explore two questions for general refreshing times. First, we investigate how the recurrence versus transience criterion known for RWRE changes for RWCRE. Second, we explore the fluctuations for RWCRE when RWRE is either recurrent or satisfies a classica…
In this work, we study open quantum random walks, as described by S. Attal et al. These objects are given in terms of completely positive maps acting on trace-class operators, leading to one of the simplest open quantum versions of the recurrence problem for classical, discrete-time random walks. This work focuses on obtaining criteria for site recurrence of nearest-neighbor, homogeneous walks on the integer line, with the description presented here making use of recent results of the theory of open walks, most particularly regarding reducibility properties of the operators involved. This allo…
We consider a randomized urn model with objects of finitely many colors. The replacement matrices are random, and are conditionally independent of the color chosen given the past. Further, the conditional expectations of the replacement matrices are close to an almost surely irreducible matrix. We obtain almost sure and $L^1$ convergence of the configuration vector, the proportion vector and the count vector. We show that first moment is sufficient for i.i.d.\ replacement matrices independent of past color choices. This significantly improves the similar results for urn models obtained in Athr…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。