English
Related papers

Related papers: KMT coupling for random walk bridges

200 papers

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

Probability · Mathematics 2020-01-06 Marek Biskup , Pierre-François Rodriguez

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

Probability · Mathematics 2009-07-15 Olivier Raimond , Bruno Schapira

We prove a quenched central limit theorem for random walks with bounded increments in a randomly evolving environment on $\mathbb{Z}^d$. We assume that the transition probabilities of the walk depend not too strongly on the environment and…

Probability · Mathematics 2009-09-29 Dmitry Dolgopyat , Gerhard Keller , Carlangelo Liverani

We prove an almost sure invariance principle for a random walker among i.i.d. conductances in $\Z^d$, $d\geq 2$. We assume conductances are bounded from above but we dot require they are bounded from below.

Probability · Mathematics 2012-09-11 P. Mathieu

Strong approximations of uniform transport processes to the standard Brownian motion rely on the Skorokhod embedding of random walk with centered double exponential increments. In this note we make such an embedding explicit by means of a…

Probability · Mathematics 2020-02-04 Giang T. Nguyen , Oscar Peralta

In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was…

Probability · Mathematics 2021-01-01 Denis Denisov , Alexander Sakhanenko , Vitali Wachtel

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

Consider a negatively drifted one dimensional Brownian motion starting at positive initial position, its first hitting time to 0 has the inverse Gaussian law. Moreover, conditionally on this hitting time, the Brownian motion up to that time…

Probability · Mathematics 2018-05-10 Christophe Sabot , Xiaolin Zeng

In this paper we revise the theory of turnpikes in discounted Markov decision processes, prove the turnpike theorem for the undiscounted model and apply the results to the specific random walk.

Probability · Mathematics 2021-02-19 Alexey Piunovskiy

It is proposed two models describing transport and absorbtion processes that occur in nanoscale fragments of electrical circuits, pulled adsorbed molecules, atomic or molecular chains connecting electrodes. Discrete chain model of a…

Mesoscale and Nanoscale Physics · Physics 2007-05-23 V. N. Evteev , M. V. Moiseenko , E. V. Zhuravel , E. Ya. Glushko

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 observe that the probability distribution of the Brownian motion with drift $-c \frac x {1-t}$ where $c\not =1$ is singular with respect to that of the classical Brownian bridge measure on $[0,1]$, while their Cameron-Martin spaces are…

Probability · Mathematics 2018-03-29 Xue-Mei Li

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

Probability · Mathematics 2021-03-29 Yiping Hu , Russell Lyons , Pengfei Tang

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

We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed…

Systems and Control · Computer Science 2014-07-15 Yongxin Chen , Tryphon Georgiou

We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.

Probability · Mathematics 2007-05-23 Itai Benjamini , Gady Kozma , Dan Romik

We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…

Representation Theory · Mathematics 2020-06-11 Arvind Ayyer , Pooja Singla

Several classical results on boundary crossing probabilities of Brownian motion and random walks are extended to asymptotically Gaussian random fields, which include sums of i.i.d. random variables with multidimensional indices,…

Probability · Mathematics 2007-05-23 Hock Peng Chan , Tze Leung Lai

We prove a general noncommutative law of large numbers. This applies in particular to random walks on any locally finite homogeneous graph, as well as to Brownian motion on Riemannian manifolds which admit a compact quotient. It also…

Probability · Mathematics 2007-05-23 Anders Karlsson , François Ledrappier

We prove that the linearly edge reinforced random walk (LRRW) on any graph with bounded degrees is recurrent for sufficiently small initial weights. In contrast, we show that for non-amenable graphs the LRRW is transient for sufficiently…

Probability · Mathematics 2014-05-08 Omer Angel , Nicholas Crawford , Gady Kozma