Related papers: Lattice Green Function (at 0) for the 4d Hypercubi…
Sums of walks for charged particles (e.g. Hofstadter electrons) on a square lattice in the presence of a magnetic field are evaluated. Returning loops are systematically added to directed paths to obtain the unrestricted propagators.…
We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of walks on $\mathbb{Z}^2$ defined by a fixed step set that is a subset of the non-zero vectors with coordinates 0, 1 or $-1$. We concern ourselves with…
We write the Green function of the $d$-dimensional hypercubic lattice in a piecewise form covering the entire real frequency axis. Each piece is a single integral involving modified Bessel functions of the first and second kinds. The…
We previously reported on a recursive method to generate the expansion of the lattice Green function of the $d$-dimensional face-centred cubic lattice (fcc). The method was used to generate many coefficients for d=7 and the corresponding…
A method to calculate exact Green's functions on lattices in various dimensions is presented. Expressions in terms of generalized hypergeometric functions in one or more variables are obtained for various examples by relating the resolvent…
The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.
This is the second of two papers on the end-to-end distance of a weakly self-repelling walk on a four dimensional hierarchical lattice. It completes the proof that the expected value grows as a constant times \sqrt{T} log^{1/8}T (1+O((log…
The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of…
We analyze a random walk strategy on undirected regular networks involving power matrix functions of the type $L^{\frac{\alpha}{2}}$ where $L$ indicates a `simple' Laplacian matrix. We refer such walks to as `Fractional Random Walks' with…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
We investigate a functional equation which resembles the functional equation for the generating function of a lattice walk model for the quarter plane. The interesting feature of this equation is that its orbit sum is zero while its…
We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each…
The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…
We present a recursive method to generate the expansion of the lattice Green function of the d-dimensional face-centred cubic (fcc) lattice. We produce a long series for d =7. Then we show (and recall) that, in order to obtain the linear…
We derive formulas for the matrix elements of the two dimensional square lattice Green function along the diagonal, and along the coordinate axes. We also give an asymptotic formula for the diagonal elements.
We give a systematic treatment of lattice Green functions (LGF) on the $d$-dimensional diamond, simple cubic, body-centred cubic and face-centred cubic lattices for arbitrary dimensionality $d \ge 2$ for the first three lattices, and for $2…
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…
It is shown that the Green's function on a finite lattice in arbitrary space dimension can be obtained from that of an infinite lattice by means of translation operator. Explicit examples are given for one- and two-dimensional lattices.
We continue the investigations of lattice walks in the three dimensional lattice restricted to the positive octant. We separate models which clearly have a D-finite generating function from models for which there is no reason to expect that…
A first order differential equation of Green's Function, at the origin G(0), for the one- dimensional lattice is derived by simple recurrence relation. Green's Function at site (m)is then calculated in terms of G(0). A simple recurrence…