相关论文: Exact Random Walk Distributions using Noncommutati…
We prove large deviations principles (LDPs) for the perimeter and the area of the convex hull of a planar random walk with finite Laplace transform of its increments. We give explicit upper and lower bounds for the rate function of the…
Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…
We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer \cite{meyer2013nonlinear}, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional…
We study continuous time quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the…
Random walks, and in particular, their first passage times, are ubiquitous in nature. Using direct enumeration of paths, we find the first return time distribution of a 1D random walker, which is a heavy-tailed distribution with infinite…
We have studied the probability distribution of the perimeter and the area of the k-th largest erased-loop in loop-erased random walks in two-dimensions for k = 1 to 3. For a random walk of N steps, for large N, the average value of the…
The diffusive transport of particles in anisotropic media is a fundamental phenomenon in computational, medical and biological disciplines. While deterministic models (partial differential equations) of such processes are well established,…
Using path integral techniques, we compute exactly the distribution of the maximal height H_p of p nonintersecting Brownian walkers over a unit time interval in one dimension, both for excursions (p-watermelons with a wall) and bridges…
We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation…
For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…
We obtain an explicit formula to enumerate closed random walks on a cubic lattice with a specified length and 3D algebraic area. The 3D algebraic area is defined as the sum of algebraic areas obtained from the walk's projection onto the…
We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a…
The special limit of the totally asymmetric zero range process of the low-dimensional non-equilibrium statistical mechanics described by the non-Hermitian Hamiltonian is considered. The calculation of the conditional probabilities of the…
We study the path behavior of the anisotropic random walk on the two-dimensional lattice Z^2. Simultaneous strong approximations of its components are given.
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…
A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…
We study the path behavior of the simple symmetric walk on some comb-type subsets of Z^2 which are obtained from Z^2 by removing all horizontal edges belonging to certain sets of values on the y-axis. We obtain some strong approximation…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.