Related papers: KMT coupling for random walk bridges
Consider a random walker on the nonnegative lattice, moving in continuous time, whose positive transition intensity is proportional to the time the walker spends at the origin. In this way, the walker is a jump process with a stochastic and…
We consider a one-dimensional simple symmetric exclusion process in equilibrium, constituting a dynamic random environment for a nearest-neighbor random walk that on occupied/vacant sites has two different local drifts to the right. We…
We introduce random interlacements for transient vertex-reinforced jump processes on a general graph $G$. Using increasing finite subgraphs $G_n$ of $G$ with wired boundary conditions, we show convergence of the vertex-reinforced jump…
By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching…
We consider the limit behavior of an excited random walk (ERW), i.e., a random walk whose transition probabilities depend on the number of times the walk has visited to the current state. We prove that an ERW being naturally scaled…
We prove that a planar random walk with bounded increments and mean zero which is conditioned to stay in a cone converges weakly to the corresponding Brownian meander if and only if the tail distribution of the exit time from the cone is…
We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…
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…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…
We prove that every directionally transient random walk in random i.i.d.\ environment, under condition $(T)_{\gamma}$, which admits an annealed functional limit towards Brownian motion also admits the corresponding quenched limit in $d \ge…
We study Aldous' conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this…
We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to develop a probabilistic perspective on Chebyshev polynomials.
We show that the squared maximal height of the top path among $N$ non-intersecting Brownian bridges starting and ending at the origin is distributed as the top eigenvalue of a random matrix drawn from the Laguerre Orthogonal Ensemble. This…
We present an exact solution for one-dimensional overdamped dynamics near a hard wall, allowing us to connect steady-state distributions under confinement with the extreme value statistics of unconfined stochastic processes. This mapping…
Start a planar Brownian motion and let it run until it hits some given barrier. We show that the barrier may be crafted so that the x coordinate at the hitting time has any prescribed centered distribution with finite variance. This…
We construct a bounded degree graph $G$, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also…
In this article, we shall start with a closed walk on a regular tree of degree $d$. These walks are described by the Kesten-McKay law which arises as the asymptotic distribution of a random $d$-regular graph on $n$ vertices. We will show…
We study the precise large deviation probabilities for the sizes of intermediate level sets in branching Brownian motion (BBM). Our conclusions improve a result of A\"{i}dekon, Hu and Shi in [J. Math. Sci. \textbf{238}(2019)]. Additionally,…