English
Related papers

Related papers: Level Crossing Probabilities I: One-dimensional Ra…

200 papers

Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…

Probability · Mathematics 2020-09-04 Shyam Narayanan

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

Probability · Mathematics 2022-06-22 Hua-Ming Wang , Lanlan Tang

We consider random walks X_n in Z+, obeying a detailed balance condition, with a weak drift towards the origin when X_n tends to infinity. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional…

Probability · Mathematics 2015-05-13 Joel De Coninck , Francois Dunlop , Thierry Huillet

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 $\omega(x)\in[\frac12,1)$, until the first time the process jumps to the left from site $x$,…

Probability · Mathematics 2015-05-13 Ross Pinsky

We study a one-dimensional random walk whose expected drift depends both on time and the position of a particle. We establish a non-trivial phase transition for the recurrence vs. transience of the walk, and show some interesting…

Probability · Mathematics 2007-11-16 Mikhail Menshikov , Stanislav Volkov

We prove limit theorems for random walks with $n$ steps in the $d$-dimensional Euclidean space as both $n$ and $d$ tend to infinity. One of our results states that the path of such a random walk, viewed as a compact subset of the…

Probability · Mathematics 2023-05-23 Zakhar Kabluchko , Alexander Marynych

Consider a random walk in $\mathbb{R}^d$ that starts at the origin and whose increment distribution assigns zero probability to any affine hyperplane. We solve Sylvester's problem for these random walks by showing that the probability that…

Probability · Mathematics 2024-09-13 Hugo Panzo

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

Probability · Mathematics 2014-04-28 Ostap Hryniv , Mikhail V. Menshikov , Andrew R. Wade

We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…

adap-org · Physics 2009-10-31 Roger Bidaux , Nino Boccara

Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution. In this work…

Computational Complexity · Computer Science 2016-09-15 Tali Kaufman , David Mass

We give new criteria for ballistic behavior of random walks in random environment which are perturbations of the simple symmetric random walk on $\mathbb Z^d$ in dimensions $d\ge 4$. Our results extend those of Sznitman [Ann. Probab. 31,…

Probability · Mathematics 2021-03-05 Ryoki Fukushima , Alejandro F. Ramírez

Spherically symmetric random walks in arbitrary dimension $D$ can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically…

High Energy Physics - Lattice · Physics 2010-11-19 Carl M. Bender , Peter N. Meisinger , Fred Cooper

In this paper, we consider a random walk and a random color scenery on Z. The increments of the walk and the colors of the scenery are assumed to be i.i.d. and to be independent of each other. We are interested in the random process of…

Probability · Mathematics 2011-12-09 Sébastien Blachère , Frank den Hollander , Jeffrey E. Steif

We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…

Probability · Mathematics 2020-08-27 Ewain Gwynne , Jason Miller

This paper considers 1-dimensional generalized random walks in random scenery. That is, the steps of the walk are generated by an arbitrary stationary process, and also the scenery is a priori arbitrary stationary. Under an ergodicity…

Dynamical Systems · Mathematics 2007-05-23 F. M. Dekking , P. Liardet

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

Probability · Mathematics 2023-10-17 Zsuzsanna Baran , Jonathan Hermon , Anđela Šarković , Perla Sousi

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

Combinatorics · Mathematics 2020-04-07 Lochlan Brick , Pu Gao , Angus Southwell

Let $X_1, X_2, \ldots$ be i.i.d. random variables with values in $\mathbb{Z}^d$ satisfying $\mathbb{P} \left(X_1=x\right) = \mathbb{P} \left(X_1=-x\right) = \Theta \left(\|x\|^{-s}\right)$ for some $s>d$. We show that the random walk…

Probability · Mathematics 2023-08-29 Johannes Bäumler

We introduce a class of nearest-neighbor integer random walks in random and non-random media, which includes excited random walks considered in the literature. At each site the random walker has a drift to the right, the strength of which…

Probability · Mathematics 2007-05-23 Martin P. W. Zerner

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

Probability · Mathematics 2021-02-15 Jimmy He
‹ Prev 1 4 5 6 7 8 10 Next ›