相关论文: Zig-zagging in a Triangulation

Given a symmetric random walk in $Z^2$ with finite second moments, let $R_n$ be the range of the random walk up to time $n$. We study moderate deviations for $R_n -E R_n$ and $E R_n -R_n$. We also derive the corresponding laws of the…

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…

We study the local time of the anisotropic random walk on the two-dimensional lattice Z^2, by establishing the exact asymptotic behavior of the N-step return probability to the origin.

A closed equilateral random walk in 3-space is a selection of unit length vectors giving the steps of the walk conditioned on the assumption that the sum of the vectors is zero. The sample space of such walks with $n$ edges is the…

We consider a random walker whose motion is tethered around a focal point. We use two models that exhibit the same spatial dependence in the steady state but widely different dynamics. In one case, the walker is subject to a deterministic…

A path integral measure for gravity should also preserve the fundamental symmetry of general relativity, which is diffeomorphism symmetry. In previous work, we argued that a successful implementation of this symmetry into discrete quantum…

We study those measures whose doubling constant is the least possible among doubling measures on a given metric space. It is shown that such measures exist on every metric space supporting at least one doubling measure. In addition, a…

We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…

We investigate active lattice walks: biased continuous time random walks which perform orientational diffusion between lattice directions in one and two spatial dimensions. We study the occupation probability of an arbitrary site on the…

We establish a second-order almost sure limit theorem for the minimal position in a one-dimensional super-critical branching random walk, and also prove a martingale convergence theorem which answers a question of Biggins and Kyprianou [9].…

We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…

The phase diagram for a two-dimensional self-avoiding walk model on the square lattice incorporating attractive short-ranged interactions between parallel sections of walk is derived using numerical transfer matrix techniques. The model…

We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…

We consider random walks in a random environment of the type p_0+\gamma\xi_z, where p_0 denotes the transition probabilities of a stationary random walk on \BbbZ^d, to nearest neighbors, and \xi_z is an i.i.d. random perturbation. We give…

We study arithmetic properties of short uniform random walks in arbitrary dimensions, with a focus on explicit (hypergeometric) evaluations of the moment functions and probability densities in the case of up to five steps. Somewhat to our…

We study the three-dimensional persistent random walk with drift. Then we develop a thermodynamic model that is based on this random walk without assuming the Boltzmann-Gibbs form for the equilibrium distribution. The simplicity of the…

This paper proposes a two-point inertial proximal point algorithm to find zero of maximal monotone operators in Hilbert spaces. We obtain weak convergence results and non-asymptotic $O(1/n)$ convergence rate of our proposed algorithm in…

We study simple random walk on the uniform spanning tree on Z^2 . We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean…

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…