Related papers: Hamiltonian and exclusion statistics approach to d…
One-dimensional discrete-time quantum walks show a rich spectrum of topological phases that have so far been exclusively analysed in momentum space. In this work we introduce an alternative approach to topology which is based on the…
The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…
This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…
Geometric aspects play an important role in the construction and analysis of structure-preserving numerical methods for a wide variety of ordinary and partial differential equations. Here we review the development and theory of symplectic…
Prime path coverage is a powerful structural testing criterion, but generating all prime paths in a directed graph remains computationally challenging due to the potentially exponential number of them. Existing approaches typically rely on…
Dynamics of a charged particle in the canonical coordinates is a Hamiltonian system, and the well-known symplectic algorithm has been regarded as the de facto method for numerical integration of Hamiltonian systems due to its long-term…
We obtain an explicit formula to enumerate closed random walks on a cubic lattice with a specified length and 3D algebraic area. The 3D algebraic area is defined as the sum of algebraic areas obtained from the walk's projection onto the…
We study the Hamiltonian dynamics of a one-dimensional chain of linearly coupled particles in a spatially periodic potential which is subjected to a time-periodic mono-frequency external field. The average over time and space of the related…
We construct admissible circulant Laplacian matrix functions as generators for strictly increasing random walks on the integer line. These Laplacian matrix functions refer to a certain class of Bernstein functions. The approach has…
We investigate the linear statistics of random matrices with purely imaginary Bernoulli entries of the form $H_{pq} = \overline{H}_{qp} = \pm i$, that are either independently distributed or exhibit global correlations imposed by the…
We derive photon counting statistics for an output field of a single-photon wave packet interacting with a quantum system (e.g. a quantum harmonic oscillator or a two-level atom). We determine the exclusive probability densities for the…
The Hammersley process relates to the statistical properties of the maximum length of all up/right paths connecting random points of a given density in the unit square from (0,0) to (1,1). This process can also be interpreted in terms of…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce a simplicial Dirac structure as a…
Branching random walks are key to the description of several physical and biological systems, such as neutron multiplication, genetics and population dynamics. For a broad class of such processes, in this Letter we derive the discrete…
In this paper we present a CAT generation algorithm for Dyck paths with a fixed length n. It is the formalization of a method for the exhaustive generation of this kind of paths which can be described by means of two equivalent strategies.…
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied. Results are proved…
This paper presents a useful compact formula for deriving an effective Hamiltonian describing the time-averaged dynamics of detuned quantum systems. The formalism also works for ensemble-averaged dynamics of stochastic systems. To…
The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.
In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how…