Related papers: Classes of Skorokhod Embeddings for the Simple Sym…
We prove a scaling limit result for random walk on certain random planar maps with its natural time parametrization. In particular, we show that for $\gamma \in (0,2)$, the random walk on the mated-CRT map with parameter $\gamma$ converges…
Geometric Brownian motion is an exemplary stochastic processes obeying multiplicative noise, with widespread applications in several fields, e.g. in finance, in physics and biology. The definition of the process depends crucially on the…
The Skorokhod Embedding Problem (SEP) is one of the classical problems in the study of stochastic processes, with applications in many different fields (cf.~ the surveys \cite{Ob04,Ho11}). Many of these applications have natural…
Semimartingale reflecting Brownian motions (SRBMs) living in the closures of domains with piecewise smooth boundaries are of interest in applied probability because of their role as heavy traffic approximations for some stochastic networks.…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We show an intimate connection between solutions of the Skorokhod Embedding Problem which are given as the first hitting time of a barrier and the concept of shadows in martingale optimal transport. More precisely, we show that a solution…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
This paper examines a stochastic deconvolution problem on compact symmetric spaces which is referred to as decompounding. This involves estimating the step distributions of a random walk, where in addition the number of steps between…
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…
This work contributes a systematic survey and complementary insights of reflecting Brownian motion and its properties. Extension of the Skorohod problem's solution to more general cases is investigated, based on which a discussion is…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…
Continuing from a companion article: 'Random walks and contracting elements I: Deviation inequality and limit laws', we study random walks on metric spaces with contracting elements. We prove that random subgroups of the isometry group of a…
Einstein-Smoluchowski diffusion, damped harmonic oscillations, and spatial decoherence are special cases of an elegant class of Markovian quantum Brownian motion models that is invariant under linear symplectic transformations. Here we…
We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…
In this paper we prove an analogue of the Koml\'os-Major-Tusn\'ady (KMT) embedding theorem for random walk bridges. The random bridges we consider are constructed through random walks with i.i.d jumps that are conditioned on the locations…
Graph embedding based on random-walks supports effective solutions for many graph-related downstream tasks. However, the abundance of embedding literature has made it increasingly difficult to compare existing methods and to identify…
We study the convergence in rough path topology of a certain class of discrete processes, the hidden Markov walks, to a Brownian motion with an area anomaly. This area anomaly, which is a new object, keeps track of the time-correlation of…
The time evolution of complex systems usually can be described through stochastic processes. These processes are measured at finite resolution, what necessarily reduces them to finite sequences of real numbers. In order to relate these data…
We address the theory of records for integrated random walks with finite variance. The long-time continuum limit of these walks is a non-Markov process known as the random acceleration process or the integral of Brownian motion. In this…