Related papers: Two explicit Skorokhod embeddings for simple symme…
We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…
We solve explicitly the following problem: for a given probability measure mu, we specify a generalised martingale diffusion X which, stopped at an independent exponential time T, is distributed according to mu. The process X is specified…
We study a model of two-player, zero-sum, stopping games with asymmetric information. We assume that the payoff depends on two continuous-time Markov chains (X, Y), where X is only observed by player 1 and Y only by player 2, implying that…
The Az\'{e}ma-Yor solution (resp., the Perkins solution) of the Skorokhod embedding problem has the property that it maximizes (resp., minimizes) the law of the maximum of the stopped process. We show that these constructions have a wider…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
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…
Given a L\'evy process $L$, we consider the so-called statistical Skorohod embedding problem of recovering the distribution of an independent random time $T$ based on i.i.d. sample from $L_{T}.$ Our approach is based on the genuine use of…
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…
Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…
Consider a system of coalescing random walks where each individual performs random walk over a finite graph G, or (more generally) evolves according to some reversible Markov chain generator Q. Let C be the first time at which all walkers…
The Skorokhod embedding problem (SEP) is to represent a given probability measure as a Brownian motion $B$ at a particular stopping time. In recent years particular attention has gone to solutions which exhibit additional optimality…
Recent work of Dupire and Carr and Lee has highlighted the importance of understanding the Skorokhod embedding originally proposed by Root for the model-independent hedging of variance options. Root's work shows that there exists a barrier…
We adapt ideas and concepts developed in optimal transport (and its martingale variant) to give a geometric description of optimal stopping times of Brownian motion subject to the constraint that the distribution of the stopping time is a…
We investigate the effects of markovian resseting events on continuous time random walks where the waiting times and the jump lengths are random variables distributed according to power law probability density functions. We prove the…
We study perturbation theory and uniform ergodicity for discrete-time Markov chains on general state spaces in terms of the uniform moments of the first hitting times on some set. The methods we adopt are different from previous ones. For…
This paper develops a time-inconsistent and path-dependent singular control framework incorporating a running minimum process. We derive a verification theorem that characterizes equilibria under substantially weaker regularity conditions…
We analyze two models of subdiffusion with stochastic resetting. Each of them consists of two parts: subdiffusion based on the continuous-time random walk (CTRW) scheme and independent resetting events generated uniformly in time according…
We study the existence, optimality, and construction of non-randomised stopping times that solve the Skorokhod embedding problem (SEP) for Markov processes which satisfy a duality assumption. These stopping times are hitting times of…
We consider a non-elementary group action $G \curvearrowright X$ of a locally compact second countable group $G$ on a possibly exotic non-discrete affine building $X$ of type $\tilde{A}_2$. We prove that if $\mu$ is an admissible symmetric…
We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any…