Related papers: Classes of Skorokhod Embeddings for the Simple Sym…
Nonergodicity observed in single-particle tracking experiments is usually modeled by transient trapping rather than spatial disorder. We introduce models of a particle diffusing in a medium consisting of regions with random sizes and random…
The stochastic motion of a particle with long-range correlated increments (the moving phase) which is intermittently interrupted by immobilizations (the traping phase) in a disordered medium is considered in the presence of an external…
Brownian motion and scaled and interpolated simple random walk can be jointly embedded in a probability space in such a way that almost surely the $n$-step walk is within a uniform distance $O(n^{-1/2}\log n)$ of the Brownian path for all…
The aim of this note is to give an alternative construction of interlacements - as introduced by Sznitman - which makes use of classical probabilistic potential theory. In particular, we outline that the intensity measure of an…
We consider random walks on the support of a random purely atomic measure on $\mathbb{R}^d$ with random jump probability rates. The jump range can be unbounded. The purely atomic measure is reversible for the random walk and stationary for…
We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…
In this paper, we provide an alternative proof of the monotonicity principle for the optimal Skorokhod embedding problem established by Beiglb\"ock, Cox and Huesmann. This principle presents a geometric characterization that reflects the…
We extend results of Y. Benoist and J.-F. Quint concerning random walks on homogeneous spaces of simple Lie groups to the case where the measure defining the random walk generates a semigroup which is not necessarily Zariski dense, but…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
We show that the product or convex combination of two Markov operators with equivalent stationary measures need not have a stationary measure from the same measure class. More specifically, we exhibit examples of a hitherto undescribed…
Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…
Donsker's theorem shows that random walks behave like Brownian motion in an asymptotic sense. This result can be used to approximate expectations associated with the time and location of a random walk when it first crosses a nonlinear…
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the…
How long a stochastic process survives before leaving a domain depends not only on its intrinsic dynamics but also on how it is observed. Classical first-passage theory assumes continuous monitoring with absorbing boundaries…
We construct a family of SDEs whose solutions select a reflected Brownian flow as well as a stochastic damped transport process (W\_t). The latter gives a representation for the solutions to the heat equation for differential 1-forms with…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
The random walk is a fundamental stochastic process that underlies many numerical tasks in scientific computing applications. We consider here two neural algorithms that can be used to efficiently implement random walks on spiking…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…