Related papers: Towards a Combinatorial Understanding of Lattice P…
We study new asymptotic invariant of a pair consisting of a group and a subgroup, which we call Commensurizer Growth. We compute the commensurizer growth for several examples, concentrating mainly on the case of a locally compact…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We study the distributions of the continuous-time quantum walk on a one-dimensional lattice. In particular we will consider walks on unbounded lattices, walks with one and two boundaries and Dirichlet boundary conditions, and walks with…
We consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality…
The growth constant for two-dimensional self-avoiding walks on the honeycomb lattice was conjectured by Nienhuis in 1982, and since that time the corresponding results for the square and triangular lattices have been sought. For the square…
The growth exponent $\alpha$ for loop-erased or Laplacian random walk on the integer lattice is defined by saying that the expected time to reach the sphere of radius $n$ is of order $n^\alpha$. We prove that in two dimensions, the growth…
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
A particular class of random walks with a spin factor on a three dimensional cubic lattice is studied. This three dimensional random walk model is a simple generalization of random walk for the two dimensional Ising model. All critical…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
The aim of this article is to introduce a unified method to obtain explicit integral representations of the trivariate generating function counting the walks with small steps which are confined to a quarter plane. For many models, this…
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 establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
We give combinatorial descriptions of two stochastic growth models for series-parallel networks introduced by Hosam Mahmoud by encoding the growth process via recursive tree structures. Using decompositions of the tree structures and…
We introduce classes of restricted walks, surfaces and their generalisations. For example, self-osculating walks (SOWs) are supersets of self-avoiding walks (SAWs) where edges are still not allowed to cross but may 'kiss' at a vertex. They…
Lattice paths in the quarter plane have led to a large and varied set of results in recent years. One major project has been the classification of step sets according to the properties of the corresponding generating functions, and this has…
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central problems, an account is given of the…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…
In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…