Related papers: Random walks on finite lattice tubes
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…
Inspired by the study of edge statistics of random band matrices, we investigate random walks on large $d$-dimensional periodic lattices, whose transition matrices are determined by discretized density functions. Under certain moment…
We recently demonstrated that standard fixed-time lattice random-walk models cannot be modified to properly represent biased diffusion processes in more than two dimensions. The origin of this fundamental limitation appears to be the fact…
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…
The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…
In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…
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…
Lattice-based random walk models are widely used to study populations of migrating cells with motility bias and proliferation. Crowding is typically represented by volume exclusion, where each lattice site can be occupied by at most one…
We study a lattice model for the spreading of fluid films, which are a few molecular layers thick, in narrow channels with inert lateral walls. We focus on systems connected to two particle reservoirs at different chemical potentials,…
A number of papers have examined various aspects of "random random" walks on finite groups; the purpose of this article is to provide a survey of this work and to show, bring together, and discuss some of the arguments and results in this…
A statistical model of loops on the three-dimensional lattice is proposed and is investigated. It is O(n)-type but has loop fugacity that depends on global three-dimensional shapes of loops in a particular fashion. It is shown that, despite…
We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…
We investigate a modified version of the $AB$ random sequential adsorption model. Specifically, this model involves the deposition of two distinct types of particles onto a lattice, with the constraint that different types cannot occupy…
We examine the sets of late points of a symmetric random walk on $Z^2$ projected onto the torus $Z^2_K$, culminating in a limit theorem for the cover time of the toral random walk. This extends the work done for the simple random walk in…
We perform numerical scattering experiments on a Lorentz array of disks centered on a triangular lattice with L columns and study its transmission and reflection properties. In the finite horizon case, the motion of the particles may be…
Random walks (RW) of particles adsorbed in the internal walls of porous deposits produced by ballistic-type growth models are studied. The particles start at the external surface of the deposits and enter their pores, in order to simulate…
We introduce finite ramified self-affine substrates in two dimensions with a set of appropriate hopping rates between nearest-neighbor sites, where the diffusion of a single random walk presents an anomalous {\it anisotropic} behavior…
Theoretical analysis of random walk on percolation lattices has predicted that, at the occupied site concentrations of above the threshold value, a characteristic crossover between an initial sub-diffusion to a final classical diffusion…
We consider the reversible adsorption of dimers on a regular lattice, where adsorption occurs on a finite fraction of sites selected randomly. By comparing this system to the pure system where all sites are available for adsorption, we show…