English
Related papers

Related papers: Quenched invariance principle for simple random wa…

200 papers

In this paper, we consider random walk in random environment on $\mathbb{Z}^{d}\,(d\geq1)$ and prove the Strassen's strong invariance principle for this model, via martingale argument and the theory of fractional coboundaries of Derriennic…

Probability · Mathematics 2010-04-20 Guangyu Yang , Yu Miao , Dihe Hu

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

Probability · Mathematics 2012-12-12 Lung-Chi Chen , Rongfeng Sun

Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…

Probability · Mathematics 2022-04-08 Van Hao Can , David A. Croydon , Takashi Kumagai

We consider a random walk on the support of a stationary simple point process on $R^d$, $d\geq 2$ which satisfies a mixing condition w.r.t.the translations or has a strictly positive density uniformly on large enough cubes. Furthermore the…

Mathematical Physics · Physics 2009-11-10 A. Faggionato , H. Schulz-Baldes , D. Spehner

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

Probability · Mathematics 2007-05-23 Majid Hosseini , Krishnamurthi Ravishankar

Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…

Probability · Mathematics 2024-02-20 Istvan Berkes , Bence Borda

In this paper, we establish a quenched invariance principle for the random walk on a certain class of infinite, aperiodic, oriented random planar graphs called "T-graphs" [Kenyon-Sheffield04]. These graphs appear, together with the…

Probability · Mathematics 2014-01-15 Benoit Laslier

Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…

Probability · Mathematics 2014-01-31 Massimo Campanino , Dimitri Petritis

We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…

Probability · Mathematics 2013-10-18 Alexander Fribergh , Alan Hammond

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…

Probability · Mathematics 2017-06-20 Florian Sobieczky

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…

Probability · Mathematics 2018-05-01 Tom Hutchcroft , Yuval Peres

The eigenvalue spectra of the transition probability matrix for random walks traversing critically disordered clusters in three different types of percolation problems show that the random walker sees a developing Euclidean signature for…

Statistical Mechanics · Physics 2009-11-07 E. Cuansing , H. Nakanishi

We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

Probability · Mathematics 2024-12-02 Amine Asselah , Bruno Schapira

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…

Probability · Mathematics 2015-06-18 Jakob E. Björnberg , Sigurdur Örn Stefánsson

We establish a second-order almost sure limit theorem for the minimal position in a one-dimensional super-critical branching random walk, and also prove a martingale convergence theorem which answers a question of Biggins and Kyprianou [9].…

Probability · Mathematics 2009-06-22 Yueyun Hu , Zhan Shi

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…

Probability · Mathematics 2011-01-07 Makoto Nakashima

We consider a continuum percolation built over stationary ergodic point processes. Assuming that the occupied region has a unique unbounded cluster and the cluster satisfies volume regularity and isoperimetric condition, we prove a quenched…

Probability · Mathematics 2023-06-28 Yutaka Takeuchi

We consider a continuum percolation model on $\R^d$, $d\geq 1$.For $t,\lambda\in (0,\infty)$ and $d\in\{1,2,3\}$, the occupied set is given by the union of independent Brownian paths running up to time $t$ whoseinitial points form a Poisson…

Probability · Mathematics 2015-12-31 Dirk Erhard , Julián Martínez , Julien Poisat

We examine a new path transform on 1-dimensional simple random walks and Brownian motion, the quantile transform. This transformation relates to identities in fluctuation theory due to Wendel, Port, Dassios and others, and to discrete and…

Probability · Mathematics 2015-09-21 Sami Assaf , Noah Forman , Jim Pitman

We consider simple random walks on random graphs embedded in $\mathbb{R}^d$ and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we…

Probability · Mathematics 2015-06-19 Arnaud Rousselle
‹ Prev 1 3 4 5 6 7 10 Next ›