English
Related papers

Related papers: KMT coupling for random walk bridges

200 papers

We revisit strong approximation theory from a new perspective, culminating in a proof of the Koml\'os-Major-Tusn\'ady embedding theorem for the simple random walk. The proof is almost entirely based on a series of soft arguments and easy…

Probability · Mathematics 2010-07-05 Sourav Chatterjee

Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…

Probability · Mathematics 2020-08-10 Manjunath Krishnapur

We prove an invariance principle for the bridge of a random walk conditioned to stay positive, when the random walk is in the domain of attraction of a stable law, both in the discrete and in the absolutely continuous setting. This includes…

Probability · Mathematics 2012-10-10 Francesco Caravenna , Loïc Chaumont

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

Probability · Mathematics 2012-10-08 Christophe Gallesco , Serguei Popov

We prove invariance principles for a mulditimensional random walk conditioned to stay in a cone. Our first result concerns convergence towards the Brownian meander in the cone. Furthermore, we prove functional convergence of $h$-transformed…

Probability · Mathematics 2015-11-03 Jetlir Duraj , Vitali Wachtel

We introduce a method to exactly generate bridge trajectories for discrete-time random walks, with arbitrary jump distributions, that are constrained to initially start at the origin and return to the origin after a fixed time. The method…

Statistical Mechanics · Physics 2021-08-25 Benjamin De Bruyne , Satya N. Majumdar , Gregory Schehr

We consider a directed random walk making either 0 or $+1$ moves and a Brownian bridge, independent of the walk, conditioned to arrive at point $b$ on time $T$. The Hamiltonian is defined as the sum of the square of increments of the bridge…

Condensed Matter · Physics 2016-08-31 Servet Martinez , Dimitri Petritis

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 one-dimensional discrete-time random walks (RWs) with arbitrary symmetric and continuous jump distributions $f(\eta)$, including the case of L\'evy flights. We study the expected maximum ${\mathbb E}[M_n]$ of bridge RWs, i.e.,…

Statistical Mechanics · Physics 2021-08-30 Benjamin De Bruyne , Satya N. Majumdar , Gregory Schehr

In a recent paper of Eichelsbacher and Koenig (2008) the model of ordered random walks has been considered. There it has been shown that, under certain moment conditions, one can construct a k-dimensional random walk conditioned to stay in…

Probability · Mathematics 2009-07-17 D. Denisov , V. Wachtel

It is known that the Brownian bridge or L\'evy-Ciesielski construction of Brownian paths almost surely converges uniformly to the true Brownian path. In the present article the focus is on the uniform error. In particular, we show…

Numerical Analysis · Mathematics 2023-08-15 Bruce Brown , Michael Griebel , Frances Y. Kuo , Ian H. Sloan

We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…

Probability · Mathematics 2022-07-19 Youri Davydov , Arkady Tempelman

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

Probability · Mathematics 2016-11-03 Denis Denisov , Alexander Sakhanenko , Vitali Wachtel

We prove that an integrated simple random walk, where random walk and integrated random walk are conditioned to return to zero, has asymptotic probability $n^{-1/2}$ to stay positive. This question is motivated by so-called random polymer…

Probability · Mathematics 2015-02-24 Frank Aurzada , Steffen Dereich , Mikhail Lifshits

The main message in this paper is that there are surprisingly many different Brownian bridges, some of them - familiar, some of them - less familiar. Many of these Brownian bridges are very close to Brownian motions. Somewhat loosely…

Statistics Theory · Mathematics 2016-01-08 Estate Khmaladze

We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…

Statistical Mechanics · Physics 2020-05-13 Francesco Mori , Satya N. Majumdar , Gregory Schehr

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

Probability · Mathematics 2013-04-10 Christophe Gallesco , Serguei Popov

We establish the Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point $n \vec{a}$ for $\vec{a}$ in $Z^d$, as $n$ increases to infinity.

Probability · Mathematics 2016-09-07 Yevgeniy Kovchegov

We study the rate of convergence of two discrete processes towards the Brownian bridge: the random walk conditioned to be zero at time 2n and the empirical process which appears in the Glivencko-Cantelli theorem. Combining a functional…

Probability · Mathematics 2026-01-19 Laurent Decreusefond , Antonin Jacquet

For a continuous function $f \in \mathcal{C}([0,1])$, define the Vervaat transform $V(f)(t):=f(\tau(f)+t \mod1)+f(1)1_{\{t+\tau(f) \geq 1\}}-f(\tau(f))$, where $\tau(f)$ corresponds to the first time at which the minimum of $f$ is attained.…

Probability · Mathematics 2015-05-11 Titus Lupu , Jim Pitman , Wenpin Tang
‹ Prev 1 2 3 10 Next ›