Related papers: Bijective counting of Kreweras walks and loopless …
This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the…
The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…
We consider Gessel walks in the plane starting at the origin $(0, 0)$ remaining in the first quadrant $i, j \geq 0$ and made of West, North-East, East and South-West steps. Let $F(m; n_1, n_2)$ denote the number of these walks with exact…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
In this article we obtain new expressions for the generating functions counting (non-singular) walks with small steps in the quarter plane. Those are given in terms of infinite series, while in the literature, the standard expressions use…
We analyze the solution of the coined quantum walk on a line. First, we derive the full solution, for arbitrary unitary transformations, by using a new approach based on the four "walk fields" which we show determine the dynamics. The…
We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random…
The distribution of the first positive position reached by a random walker starting at the origin is central to the analysis of extremes and records in one-dimensional random walks. In this work, we present a detailed and self-contained…
A quantum walk whose continuous limit coincides with Dirac equation is usually called a Dirac Quantum Walk (DQW). A new systematic method to build DQWs coupled to electromagnetic (EM) fields is introduced and put to test on several examples…
We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices in low dimensions. By definition, these are sets of k disjoint paths whose union visits each lattice vertex exactly once. The well-known…
We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…
We count the number of walks of length n on a k-node circular digraph that cover all k nodes in two ways. The first way illustrates the transfer-matrix method. The second involves counting various classes of height-restricted lattice paths.…
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
Beaton, Owczarek and Xu (2019) studied generating functions of Kreweras walks and of reverse Kreweras walks in the quarter plane, with interacting boundaries. They proved that for the reverse Kreweras step set, the generating function is…
In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard…
At the end of the 1960s, Knuth characterised the permutations that can be sorted using a stack in terms of forbidden patterns. He also showed that they are in bijection with Dyck paths and thus counted by the Catalan numbers. Subsequently,…
We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed ("averaged")…