Related papers: Exact enumeration of self-avoiding walks
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…
We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…
We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…
We study lattice walks in a Weyl chamber of type A with fixed or free end points. For lattice walk models with zero drift that may be counted by means of a reflection argument, we determine asymptotics for the number of such walks as their…
We consider the model of self-avoiding walks on the $d$-dimensional hypercubic lattice interacting with a $d^*$-dimensional defect, where $1\leq d^*<d$. Such an interaction can be attractive or repulsive, and is controlled by a Boltzmann…
We implement the proof of principle for the quantum walk of one ion in a linear ion trap. With a single-step fidelity exceeding 0.99, we perform three steps of an asymmetric walk on the line. We clearly reveal the differences to its…
A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…
We study three-dimensional self-avoiding walks in presence of a one-dimensional excluded region. We show the appearance of a universal sub-leading exponent which is independent of the particular shape and symmetries of the excluded region.…
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 consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled with lattices that contain static defects which reverse the walker's direction. We implement a dephasing process…
We study the large-scale dynamics of event chain Monte Carlo algorithms in one dimension, and their relation to the true self-avoiding walk. In particular, we study the influence of stress, and different forms of interaction on the…
We consider the Distinct Shortest Walks problem. Given two vertices $s$ and $t$ of a graph database $\mathcal{D}$ and a regular path query, enumerate all walks of minimal length from $s$ to $t$ that carry a label that conforms to the query.…
We address the problem of enumerating paths in square lattices, where allowed steps include (1,0) and (0,1) everywhere, and (1,1) above the diagonal y=x. We consider two such lattices differing in whether the (1,1) steps are allowed along…
Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…
This note addresses the meander enumeration problem: "Count all topologically inequivalent configurations of a closed planar non self-intersecting curve crossing a line through a given number of points". We review a description of meanders…
This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very…
We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration…
Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…
We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…