Related papers: Counting lattice walks by winding angle
We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two…
We consider inhomogeneous lattice walk models in a half-space and in the quarter plane. For the models in a half-space, we show by a generalization of the kernel method to linear systems of functional equations that their generating…
This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…
We study the path behavior of the symmetric walk on some special comb-type subsets of ${\mathbb Z}^2$ which are obtained from ${\mathbb Z}^2$ by generalizing the comb having finitely many horizontal lines instead of one.
We introduce a new model of interacting spin 1/2. It describes interaction of three nearest neighbors. The Hamiltonian can be expressed in terms of Fredkin gates. The Fredkin gate (also known as the CSWAP gate) is a computational circuit…
In this paper, for any integer $k\geq 2$, we study the distribution of the visible lattice points in certain generalized P\'{o}lya's walk on $\mathbb{Z}^k$: perturbed P\'{o}lya's walk and twisted P\'{o}lya's walk. For the first case, we…
In complex analysis, the winding number measures the number of times a path (counter-clockwise) winds around a point, while the Cauchy index can approximate how the path winds. We formalise this approximation in the Isabelle theorem prover,…
We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…
We calculate the third coefficient of the lattice beta function in QCD with Wilson fermions, extending the pure gauge results of Luescher and Weisz; we show how this coefficient modifies the scaling function on the lattice. We also…
We study an approach to obtaining the exact formal solution of the 2-species Lotka-Volterra equation based on combinatorics and generating functions. By employing a combination of Carleman linearization and Mori-Zwanzig reduction…
We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.
A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension.…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…
We introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…
In classical physics, calculating the slack of a hanging chain is a problem that has attracted interest. This study aims to solve this problem through experiment and theory. When the length and distance of both the ends of a hanging chain…
We study lattice walks in a Weyl chamber of type A with fixed or free end points. For lattice walk models with zero drift that may be counted by means of a reflection argument, we determine asymptotics for the number of such walks as their…
A new characterization of the Lovasz theta function is provided by relating it to the (weighted) walk-generating function, thus establishing a relationship between two seemingly quite distinct concepts in algebraic graph theory. An…