Related papers: Green's Function for a Hierarchical Self-Avoiding …
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 random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-\alpha}$ with $\alpha>0$.…
We consider a self-avoiding walk on the $d$-dimensional hypercubic lattice, terminally attached to an impenetrable hyperplane at which it can adsorb. When a force is applied the walk can be pulled off the surface and we consider the…
Using a path integral approach and bosonization, we calculate the low energy asymptotics of the one particle Green's function for a ``magnetically incoherent'' one dimensional strongly interacting electron gas at temperatures much greater…
The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice in the critical region are investigated. We study numerically two scaling functions:…
We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…
We consider a self-avoiding walk model (SAW) on the faces of the square lattice $\mathbb{Z}^2$. This walk can traverse the same face twice, but crosses any edge at most once. The weight of a walk is a product of local weights: each square…
We deduce the dynamic frequency-domain-lattice Green's function of a linear chain with properties (masses and next-neighbor spring constants) of exponential spatial dependence. We analyze the system as discrete chain as well as the…
We have produced extended series for two-dimensional prudent polygons, based on a transfer matrix algorithm of complexity O$(n^5),$ for a series of length $n.$ We have extended the definition to three dimensions and produced series…
How long does a self-avoiding walk on a discrete $d$-dimensional torus have to be before it begins to behave differently from a self-avoiding walk on $\mathbb{Z}^d$? We consider a version of this question for weakly self-avoiding walk on a…
We attempt to extract a homological structure of two kinds of graphs by the Grover walk. The first one consists of a cycle and two semi-infinite lines and the second one is assembled by a periodic embedding of the cycles in $\mathbb{Z}$. We…
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…
Higher Green functions are real-valued functions of two variables on the upper half plane which are bi-invariant under the action of a congruence subgroup, have logarithmic singularity along the diagonal, but instead of the usual equation…
Within the framework of many-particle perturbation theory, we develop an analytical approach that allows us to determine the small distance behavior of Green's functions and related quantities in electronic structure theory. As a case…
As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…
In this work, we present a simple and efficient generator of polymeric linear chains, based on a random self-avoiding walk process. The chains are generated using a discrete process of growth, in cubic networks and in a finite time, without…
We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…
As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…
We consider random elliptic equations in dimension $d\geq 3$ at small ellipticity contrast. We derive the large-distance asymptotic expansion of the annealed Green's function up to order $4$ in $d=3$ and up to order $d+2$ for $d\geq 4$. We…
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…