Related papers: Classes of Skorokhod Embeddings for the Simple Sym…
We consider optimal approximation with respect to the mean square error of It\^o integrals and Skorohod integrals given an equidistant discretization of the Brownian motion. We obtain for suitable integrands optimal rates smaller than the…
A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.
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…
A symmetric random walk $X$ whose jumps have diffuse law, looked at up to an independent geometric random time, splits at the minimum into two independent and identically distributed pieces. The same for the maximum. It is natural to ask,…
We consider one-dimensional excited random walks (ERWs) with i.i.d. markovian cookie stacks in the non-boundary recurrent regime. We prove that under diffusive scaling such an ERW converges in the standard Skorokhod topology to a multiple…
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$,…
We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
In this work we introduce correlated random walks on $\Z$. When picking suitably at random the coefficient of correlation, and taking the average over a large number of walks, we obtain a discrete Gaussian process, whose scaling limit is…
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…
Let $(X_n \colon n\in\Z)$ be a two-sided recurrent Markov chain with fixed initial state $X_0$ and let $\nu$ be a probability measure on its state space. We give a necessary and sufficient criterion for the existence of a non-randomized…
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…
We ask if it is possible to find some particular continuous paths of unit length in linear Brownian motion. Beginning with a discrete version of the problem, we derive the asymptotics of the expected waiting time for several interesting…
The Skorokhod reflection was used in 1961 to create a reflected diffusion on the half-line. Later, it was used for processes with jumps such as reflected L\'evy processes. Like a Brownian motion, which is a weak limit of random walks,…
We consider an n-dimensional Brownian Motion trapped inside a bounded convex set by normally-reflecting boundaries. It is well-known that this process is uniformly ergodic. However, the rates of this ergodicity are not well-understood,…
Consider a large system of $N$ Brownian motions in $\R ^d$ fixed on a time interval $[0,\beta]$ with symmetrized initial and terminal conditions, under the influence of a trap potential. Such systems describe systems of bosons at positive…
We study products of random isometries acting on Euclidean space. Building on previous work of the second author, we prove a local limit theorem for balls of shrinking radius with exponential speed under the assumption that a Markov…
It is well known that given two probability measures $\mu$ and $\nu$ on $\mathbb{R}$ in convex order there exists a discrete-time martingale with these marginals. Several solutions are known (for example from the literature on the Skorokhod…
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…
We define a class of random measures, spatially independent martingales, which we view as a natural generalisation of the canonical random discrete set, and which includes as special cases many variants of fractal percolation and Poissonian…