Related papers: Walks on the slit plane: other approaches
Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…
A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent…
In this work we consider two different aspects of weighted walks in cones. To begin we examine a particular weighted model, known as the Gouyou-Beauchamps model. Using the theory of analytic combinatorics in several variables we obtain the…
It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
We consider Gessel walks in the plane starting at the origin $(0, 0)$ remaining in the first quadrant $i, j \geq 0$ and made of West, North-East, East and South-West steps. Let $F(m; n_1, n_2)$ denote the number of these walks with exact…
This paper is concerned with the continuous-time quantum walk on Z, Z^d, and infinite homogeneous trees. By using the generating function method, we compute the limit of the average probability distribution for the general isotropic walk on…
We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets…
For an $n$-vertex graph $G$, the walk matrix of $G$, denoted by $W(G)$, is the matrix $[e,A(G)e,\ldots,(A(G))^{n-1}e]$, where $A(G)$ is the adjacency matrix of $G$ and $e$ is the all-ones vector. For two integers $m$ and $\ell$ with $1\le…
We develop the theory of the $W$ and $Z$ scale functions for right-continuous (upwards skip-free) discrete-time discrete-space random walks, along the lines of the analogue theory for spectrally negative L\'evy processes. Notably, we…
We analyze the solution of the coined quantum walk on a line. First, we derive the full solution, for arbitrary unitary transformations, by using a new approach based on the four "walk fields" which we show determine the dynamics. The…
One can define a random walk on a hypercubic lattice in a space of integer dimension $D$. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
In this paper, I derive a generating function for discrete Motzkin paths of step size +2,+1,-1, restricted between two absorbing parallel lines, and generalized to arbitrary step weights. This continues off work of similar problems…
We study the area distribution of closed walks of length $n$, beginning and ending at the origin. The concept of area of a walk in the square lattice is generalized and the usefulness of the new concept is demonstrated through a simple…
We study the Shortest-Walk Problem (SWP) in a Graph of Convex Sets (GCS). A GCS is a graph where each vertex is paired with a convex program, and each edge couples adjacent programs via additional costs and constraints. A walk in a GCS is a…
\L{}ukasiewicz paths are lattice paths in $\Bbb{N}^2$ starting at the origin, ending on the $x$-axis, and consisting of steps in the set $\{(1,k), k\geq -1\}$. We give generating function and exact value for the number of $n$-length…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…
Let $F$ be a distribution function on the integer lattice $\mathbb{Z}$ and $S=(S_n)$ the random walk with step distribution $F$. Suppose $S$ is oscillatory and denote by $U_{\rm a}(x)$ and $u_{\rm a}(x)$ the renewal function and sequence,…