Related papers: Asymptotic lattice path enumeration using diagonal…
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…
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…
Suppose we are given the free product V of a finite family of finite or countable sets. We consider a transient random walk on the free product arising naturally from a convex combination of random walks on the free factors. We prove the…
We prove that on the set of lattice paths with steps N=(0,1) and E=(1,0) that lie between two fixed boundaries T and B (which are themselves lattice paths), the statistics `number of E steps shared with B' and `number of E steps shared with…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
We have shown that the partition function of the Asymmetric Simple Exclusion Process with open boundaries in a sublattice-parallel updating scheme is equal to that of a two-dimensional one-transit walk model defined on a diagonally rotated…
The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…
An asymptotic theory is developed for a moving drop driven by a wettability gradient. We distinguish the mesoscale where an exact solution is known for the properly simplified problem. This solution is matched at both -- the advancing and…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
In this paper cycles for asymptotic solutions for Heckman-Opdam hypergeometric system of type $A_n$ are described. Cycles are enumerated by elements of symmetric group. Leading asymptotic and leading coefficient are calculated. Value of…
We propose an experimental mathematics approach leading to the computer-driven discovery of various structural properties of general counting functions coming from enumeration of walks.
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
In the 1970s, William Tutte developed a clever algebraic approach, based on certain "invariants", to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks…
If the step distribution in a renewal process has finite mean and regularly varying tail with index -{\alpha}, 1<{\alpha}<2, the first two terms in the asymptotic expansion of the renewal function have been known for many years. Here we…
Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…
We study the growing patterns in the rotor-router model formed by adding $N$ walkers at the center of a $L \times L$ two-dimensional square lattice, starting with a periodic background of arrows, and relaxing to a stable configuration. The…
In this paper we consider a nonlocal evolution problem and obtain by a scaling method the first term in the asymptotic behavior of the solutions. The method employed treats in different way the smooth and the rough part of the solution.
We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…