English
Related papers

Related papers: Two explicit Skorokhod embeddings for simple symme…

200 papers

In order to approximate a continuous time stochastic process by discrete time Markov chains one has several options to embed the Markov chains into continuous time processes. On the one hand there is the Markov embedding, which uses…

Probability · Mathematics 2020-04-17 Björn Böttcher

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

Systems and Control · Computer Science 2019-01-11 Andrew Clark , Basel Alomair , Linda Bushnell , Radha Poovendran

Suppose $X$ is a time-homogeneous diffusion on an interval $I^X \subseteq \mathbb R$ and let $\mu$ be a probability measure on $I^X$. Then $\tau$ is a solution of the Skorokhod embedding problem (SEP) for $\mu$ in $X$ if $\tau$ is a…

Probability · Mathematics 2014-03-11 David Hobson

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ having increments $(1,0)$, $(-1,1)$, $(0,-1)$ with jump probabilities $\lambda(M_k)$, $\mu_1(M_k)$, and $\mu_2(M_k)$ where $M$ is an irreducible aperiodic finite state Markov…

Probability · Mathematics 2019-09-17 Fatma Başoğlu Kabran , Ali Devin Sezer

We prove a strong duality result for a linear programming problem which has the interpretation of being a discretised optimal Skorokhod embedding problem, and we recover this continuous time problem as a limit of the discrete problems. With…

Probability · Mathematics 2017-02-24 Alexander M. G. Cox , Sam M. Kinsley

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

Probability · Mathematics 2026-04-08 Antal A. Járai , Christian Mönch , Lorenzo Taggi

In this paper we introduce a numerical method for optimal stopping in the framework of one dimensional diffusion. We use the Skorokhod embedding in order to construct recombining tree approximations for diffusions with general coefficients.…

Mathematical Finance · Quantitative Finance 2020-07-14 Benjamin Gottesman Berdah

We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…

Quantum Physics · Physics 2011-04-21 Andre Ahlbrecht , Holger Vogts , Albert H. Werner , Reinhard F. Werner

We prove that for a random walk on the real line whose increments have zero mean and are either integer-valued or spread out (i.e. the distributions of the steps of the walk are eventually non-singular), the Markov chain of overshoots above…

Probability · Mathematics 2019-05-14 Aleksandar Mijatović , Vladislav Vysotsky

We provide a new probabilistic proof of the connection between Rost's solution of the Skorokhod embedding problem and a suitable family of optimal stopping problems for Brownian motion with finite time-horizon. In particular we use…

Probability · Mathematics 2017-01-10 Tiziano De Angelis

In this note, by an elementary use of Girsanov's transform we show that the exit time for either a biased random walk or a drifted Brownian motion on a symmetric interval is stochastically monotone with respect to the drift parameter. In…

Probability · Mathematics 2025-06-05 Xi Geng , Greg Markowsky

Motivated by a connection to the infinite Ginibre point process, decoupled random walks were introduced in a recent article Alsmeyer, Iksanov and Kabluchko (2025). The decoupled random walk is a sequence of independent random variables, in…

Probability · Mathematics 2026-01-07 Alexander Iksanov , Zakhar Kabluchko , Vitali Wachtel

We consider the discrete time unitary dynamics given by a quantum walk on $\Z^d$ performed by a particle with internal degree of freedom, called coin state, according to the following iterated rule: a unitary update of the coin state takes…

Mathematical Physics · Physics 2015-05-30 Eman Hamza , Alain Joye

We define the probability structure of a continuous-time time-homogeneous Markov jump process, on a finite graph, that represents the continuous-time counterpart of the so-called Ruelle-Bowen discrete-time random walk. It constitutes the…

Optimization and Control · Mathematics 2018-02-14 Yongxin Chen , Tryphon T. Georgiou , Michele Pavon

Given an initial (resp., terminal) probability measure $\mu$ (resp., $\nu$) on $\mathbb{R}^d$, we characterize those optimal stopping times $\tau$ that maximize or minimize the functional $\mathbb{E} |B_0 - B_\tau|^{\alpha}$, $\alpha > 0$,…

Probability · Mathematics 2017-11-09 Nassif Ghoussoub , Young-Heon Kim , Tongseok Lim

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

Probability · Mathematics 2016-09-07 Cheng-Der Fuh

In 2008, T\'oth and Vet\H{o} defined the self-repelling random walk with directed edges as a non-Markovian random walk on $\mathbb{Z}$: in this model, the probability that the walk moves from a point of $\mathbb{Z}$ to a given neighbor…

Probability · Mathematics 2026-01-14 Laure Marêché

Let $G$ be a real Lie group, $\Lambda\leq G$ a lattice, and $\Omega=G/\Lambda$. We study the equidistribution properties of the left random walk on $\Omega$ induced by a probability measure $\mu$ on $G$. It is assumed that $\mu$ has a…

Dynamical Systems · Mathematics 2022-05-26 Timothée Bénard , Nicolas de Saxcé

We provide a complete characterisation of the Root solution to the Skorokhod embedding problem (SEP) by means of an optimal stopping formulation. Our methods are purely probabilistic and the analysis relies on a tailored time-reversal…

Probability · Mathematics 2017-03-27 Alexander M. G. Cox , Jan Obłój , Nizar Touzi

We consider a class of discrete time Markov chains with state space [0,1] and the following dynamics. At each time step, first the direction of the next transition is chosen at random with probability depending on the current location. Then…

Probability · Mathematics 2014-12-04 Shaun McKinlay , Konstantin Borovkov