English
Related papers

Related papers: Two-sided random walks conditioned to have no inte…

200 papers

We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov…

Probability · Mathematics 2017-11-03 Oliver Sargent

We consider simple random walk on Z^d, d bigger or equal to 3. Motivated by the work of A.-S. Sznitman and the author in arXiv:1304.7477 and arXiv:1310.2177, we investigate the asymptotic behaviour of the probability that a large body gets…

Probability · Mathematics 2017-06-20 Xinyi Li

We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…

Probability · Mathematics 2007-05-23 Peter Eichelsbacher , Wolfgang Konig

We consider a transient random walk on $Z^d$ which is asymptotically stable, without centering, in a sense which allows different norming for each component. The paper is devoted to the asymptotics of the probability of the first return to…

Probability · Mathematics 2011-04-19 Ron Doney , Dmitry Korshunov

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…

Probability · Mathematics 2015-09-08 Noam Berger , Ron Rosenthal

Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…

Probability · Mathematics 2018-08-17 Tianyao Chen , Xue Cheng , Jingping Yang

We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…

Probability · Mathematics 2018-11-06 Clément Berenfeld , Ery Arias-Castro

We study the path behavior of the simple symmetric walk on some comb-type subsets of Z^2 which are obtained from Z^2 by removing all horizontal edges belonging to certain sets of values on the y-axis. We obtain some strong approximation…

Probability · Mathematics 2019-08-07 Endre Csaki , Antonia Foldes

We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…

Probability · Mathematics 2007-12-03 Iddo Ben-Ari , Mathieu Merle , Alexander Roitershtein

We consider $d$ independent walkers in the same random environment in $\mathbb{Z}$. Our assumption on the law of the environment is such that a single walker is transient to the right but subballistic. We show that - no matter what $d$ is -…

Probability · Mathematics 2019-09-04 Alexis Devulder , Nina Gantert , Françoise Pene

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…

Probability · Mathematics 2010-09-06 Itai Benjamini , Gady Kozma , Bruno Schapira

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Probability · Mathematics 2016-06-14 Jonathon Peterson

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

Probability · Mathematics 2012-06-11 Frank den Hollander , Alex A. Opoku

We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…

Probability · Mathematics 2011-10-18 M. V. Menshikov , Andrew R. Wade

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

Probability · Mathematics 2019-12-25 Vincent Beffara , Cong Bang Huynh

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…

Computational Complexity · Computer Science 2017-05-11 Till Fluschnik , Marco Morik , Manuel Sorge

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

Probability · Mathematics 2015-09-15 Peggy Cénac , Basile De Loynes , Arnaud Le Ny , Yoann Offret

Consider a continuous time random walk in $\mathbb{Z}$ with independent and exponentially distributed jumps $\pm1$. The model in this paper consists in an infinite number of such random walks starting from the complement of…

Mathematical Physics · Physics 2013-07-25 Mark Adler , Patrik L. Ferrari , Pierre van Moerbeke

We consider d independent walkers on Z, m of them performing simple symmetric random walk and r = d -- m of them performing recurrent RWRE (Sinai walk), in I independent random environments. We show that the product is recurrent, almost…

Probability · Mathematics 2018-07-12 Alexis Devulder , Nina Gantert , Françoise Pene