Related papers: Exclusion statistics and lattice random walks
Random walks on general graphs play an important role in the understanding of the general theory of stochastic processes. Beyond their fundamental interest in probability theory, they arise also as simple models of physical systems. A brief…
Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…
We extend the notion of the associated random walk and the Wald martingale in random walks where the increments are independent and identically distributed to the more general case of stationary ergodic increments. Examples are given where…
We study a model of aggregation and fragmentation of clusters of particles on an open segment of a single-lane road. The particles and clusters obey the stochastic discrete-time discrete-space kinetics of the Totally Asymmetric Simple…
The exclusion process in which particles may jump any distance l>=1 with the probability that decays as l^-(1+sigma) is studied from coarse-grained equation for density profile in the limit when the lattice spacing goes to zero. For…
We describe a new algorithm, the reflection method, to generate off-lattice random walks of specified, though arbitrarily large, thickness in $\mathbb{R}^3$ and prove that our method is ergodic on the space of thick walks. The data…
In this note we show that the area of the partitions making up an oscillating tableaux is described by a random walk on the first quadrant of $\mathbb{Z}^2$ with certain position dependent weights. We are able to recursively calculate the…
We investigate the diffusion limited aggregation of particles executing persistent random walks. The scaling properties of both random walks and large aggregates are presented. The aggregates exhibit a crossover between ballistic and…
We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…
We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…
The exact solution of the asymmetric exclusion problem and several of its generalizations is obtained by a matrix product {\it ansatz}. Due to the similarity of the master equation and the Schr\"odinger equation at imaginary times the…
We consider a system consisting of a planar random walk on a square lattice, submitted to stochastic elementary local deformations. Depending on the deformation transition rates, and specifically on a parameter $\eta$ which breaks the…
The two-dimensional cell-sorting problem is found to be mathematically equivalent to the one-dimensional random walk problem with pair creations and annihilations, i.e. the adhesion probabilities in the cell-sorting model relate…
Relations between the mean values of distributions of flipped spins on periodic Heisenberg XX chain and some aspects of enumerative combinatorics are discussed. The Bethe vectors, which are the state-vectors of the model, are considered…
We compute a number of distance-dependent universal scaling functions characterizing the distance statistics of large maps of genus one. In particular, we obtain explicitly the probability distribution for the length of the shortest…
We propose a novel combinatorial algorithm for efficient generation of Hamiltonian walks and cycles on a cubic lattice, modeling the conformations of lattice toy proteins. Through extensive tests on small lattices (allowing complete…
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…
The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…
A new distribution for systems of particles obeying statistical exclusion of correlated states is presented following the Haldane's state counting. It relies upon a conjecture to deal with the multiple exclusion that takes place when the…