Related papers: Lattice paths with catastrophes
We consider quantum trajectories of composite systems as generated by the stochastic unraveling of the respective Lindblad-master-equation. Their classical limit is taken to correspond to local jumps between orthogonal states. Based on…
In the worldline formalism, scalar Quantum Electrodynamics on a 2-dimensional lattice is related to the areas of closed loops on this lattice. We exploit this relationship in order to determine the general structure of the moments of the…
We solve two problems regarding the enumeration of lattice paths in $\mathbb{Z}^2$ with steps $(1,1)$ and $(1,-1)$ with respect to the major index, defined as the sum of the positions of the valleys, and to the number of certain crossings.…
We investigate modifications of the discrete-time lattice action, for a quantum mechanical particle in one spatial dimension, that vanish in the na\"ive continuum limit but which, nevertheless, induce non-trivial effects due to quantum…
In this paper we study a subfamily of a classic lattice path, the \emph{Dyck paths}, called \emph{restricted $d$-Dyck} paths, in short $d$-Dyck. A valley of a Dyck path $P$ is a local minimum of $P$; if the difference between the heights of…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
In the last few years several new Random Matrix Models have been proposed and studied. They have found application in various different contexts, ranging from the physics of mesoscopic systems to the chiral transition in lattice gauge…
We use path-integrals to derive a general expression for the semiclassical approximation to the partition function of a one-dimensional quantum-mechanical system. Our expression depends solely on ordinary integrals which involve the…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of embedded trees and map enumeration. The aim of this note is to apply this method to three problems.…
Message-passing architectures struggle to sufficiently model long-range dependencies in node and graph prediction tasks. We propose a novel approach exploiting hierarchical graph structures and adaptive random walks to address this…
A quantum random walk model is established on a one-dimensional periodic lattice that fluctuates between two possible states. This model is defined by Lindblad rate equations that incorporate the transition rates between the two lattice…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…
We consider a model of open quantum random walk and together with a quantum trajectory approach we are able to examine a notion of hitting time. We see that many constructions, such as minimal solutions to hitting time problems, are…
A {\em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and…
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of several domains (e.g., probability, statistical physics, computer science). The aim of this paper is to propose a new approach to obtain some…
Returning walks on a lattice are sequences of moves that start at a given lattice site and return to the same site after $n$ steps. Determining the total number of returning walks of a given length $n$ is a typical graph-theoretical problem…
Generalized Dyck paths (or discrete excursions) are one-dimensional paths that take their steps in a given finite set S, start and end at height 0, and remain at a non-negative height. Bousquet-M\'elou showed that the generating function…
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…