Related papers: Weighted Lattice Walks and Universality Classes
Attributing a positive value \tau_x to each x in Z^d, we investigate a nearest-neighbour random walk which is reversible for the measure with weights (\tau_x), often known as "Bouchaud's trap model". We assume that these weights are…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
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 we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
We consider planar lattice walks that start from (0,0), remain inthe first quadrant i, j >= 0, and are made of three types of steps: North-East, West and South. These walks are known to have remarkable enumerative and probabilistic…
The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to…
Spherically symmetric random walks in arbitrary dimension $D$ can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically…
We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree. The term \textit{multiplexed} means that the model can be viewed as a nearest…
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…
Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…
We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
The study of random walks has increasingly been popular across diverse disciplines such as statistics, mathematics, quantum physics, where they are used to model paths consisting of successive random steps in a mathematical space. A…
We study random walks evolving in continuous time on a one-dimensional lattice where each site $x$ hosts a quenched random potential $U_x$. The potentials on different sites are independent, identically distributed Gaussian random…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
We introduce and solve a family of discrete models of 2D Lorentzian gravity with higher curvature, which possess mutually commuting transfer matrices, and whose spectral parameter interpolates between flat and curved space-times. We further…
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 introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by…
The enumeration of walks in the quarter plane confined in the first quadrant has attracted a lot of attention over the past fifteenth years. The generating functions associated to small steps models satisfy a functional equation in two…
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…