相关论文: Walks obeying two-step rules on the square lattice…

Oriented self-avoiding walks (OSAWs) on a square lattice are studied, with binding energies between steps that are oriented parallel across a face of the lattice. By means of exact enumeration and Monte Carlo simulation, we reconstruct the…

An interesting open conjecture asks whether it is possible to walk to infinity along primes, where each term in the sequence has one digit more than the previous. We present different greedy models for prime walks to predict the long-time…

We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…

We consider weighted small step walks in the positive quadrant, and provide algebraicity and differential transcendence results for the underlying generating functions: we prove that depending on the probabilities of allowed steps, certain…

In many recent studies on random walks with small jumps in the quarter plane, it has been noticed that the so-called "group" of the walk governs the behavior of a number of quantities, in particular through its "order". In this paper, when…

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…

There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…

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,…

An interesting question, known as the Gaussian moat problem, asks whether it is possible to walk to infinity on Gaussian primes with steps of bounded length. Our work examines a similar situation in the real quadratic integer ring…

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 prove the limit theorem for paths of random walks with $n$ steps in $\mathbb{R}^d$ as $n$ and $d$ both go to infinity. For this, the paths are viewed as finite metric spaces equipped with the $\ell_p$-metric for $p\in[1,\infty)$. Under…

This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…

A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…

This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined set of sets and explores all possible extensions in parallel.…

We calculate the number of open walks of fixed length and algebraic area on a square planar lattice by an extension of the operator method used for the enumeration of closed walks. The open walk area is defined by closing the walks with a…

We introduce a new type of discrete quantum walks, called vertex-face walks, based on orientable embeddings. We first establish a spectral correspondence between the transition matrix $U$ and the vertex-face incidence structure. Using the…

We give a topological classification of quantum walks on an infinite 1D lattice, which obey one of the discrete symmetry groups of the tenfold way, have a gap around some eigenvalues at symmetry protected points, and satisfy a mild locality…

Circuits play a fundamental role in the theory of linear programming due to their intimate connection to algorithms of combinatorial optimization and the efficiency of the simplex method. We are interested in better understanding the…