相关论文: The compensation approach for walks with small ste…
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 approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.
The control of qubit states is often impeded by systematic control errors. Compensating pulse sequences have emerged as a resource efficient method for quantum error reduction. In this review, we discuss compensating composite pulse…
Under some mild condition, a random walk in the plane is recurrent. In particular each trajectory is dense, and a natural question is how much time one needs to approach a given small neighborhood of the origin. We address this question in…
We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert…
We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…
We focus on the algebraic area probability distribution of planar random walks on a square lattice with $m_1$, $m_2$, $l_1$ and $l_2$ steps right, left, up and down. We aim, in particular, at the algebraic area generating function…
We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…
We develop the theory of the $W$ and $Z$ scale functions for right-continuous (upwards skip-free) discrete-time discrete-space random walks, along the lines of the analogue theory for spectrally negative L\'evy processes. Notably, we…
We count a large class of lattice paths by using factorizations of free monoids. Besides the classical lattice paths counting problems related to Catalan numbers, we give a new approach to the problem of counting walks on the slit plane…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
A mesoscopic approach to modeling pedestrian simulation with multiple exits is proposed in this paper. A floor field based on Qlearning Algorithm is used. Attractiveness of exits to pedestrian typically is based on shortest path. However,…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…
We numerically implement the variational approach for reconstruction in the inverse crack and cavity problems developed by one of the authors. The method is based on a suitably adapted free-discontinuity problem. Its main features are the…
In this paper we investigate one dimensional quantum walks with two-step memory, which can be viewed as an extension of quantum walks with one-step memory. We develop a general formula for the amplitudes of the two-step-memory walk with…
Using spectral graph theory, we show how to obtain inequalities for the number of walks in graphs from nonnegative polynomials and present a new family of such inequalities.
We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…
We introduce an object called a \emph{subspace graph} that formalizes the technique of multidimensional quantum walks. Composing subspace graphs allows one to seamlessly combine quantum and classical reasoning, keeping a classical structure…
Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in $\{0, \pm 1\}^2$: the generating function is D-finite if…