Related papers: Counting lattice walks by winding angle
Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in $\mathbb C^2$, and we give an…
We continue the enumeration of plane lattice paths avoiding the negative quadrant initiated by the first author in [Bousquet-M{\'e}lou, 2016]. We solve in detail a new case, the king walks, where all 8 nearest neighbour steps are allowed.…
We show that the Density of States (DoS) for lattice Self Avoiding Walks can be estimated by using an inverse algorithm, called flatIGW, whose step-growth rules are dynamically adjusted by requiring the energy histogram to be locally flat.…
We introduce a new poset structure on Dyck paths where the covering relation is a particular case of the relation inducing the Tamari lattice. We prove that the transitive closure of this relation endows Dyck paths with a lattice structure.…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…
We report on an exact calculation of lattice correlation functions on a finite four-dimensional lattice with either Euclidean or Minkowskian signature. The lattice correlation functions are calculated by the method of differential…
We study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…
Exact results are obtained for random walks on finite lattice tubes with a single source and absorbing lattice sites at the ends. Explicit formulae are derived for the absorption probabilities at the ends and for the expectations that a…
We develop a general mapping from given kink or pulse shaped travelling-wave solutions including their velocity to the equations of motion on one-dimensional lattices which support these solutions. We apply this mapping - by definition an…
Using a general Green function formulation, we re-derive, both, (i) Spitzer and his followers results for the winding angle distribution of the planar Brownian motion, and (ii) Edwards-Prager-Frisch results on the statistical mechanics of a…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
This paper is the first application of the compensation approach to counting problems. We discuss how this method can be applied to a general class of walks in the quarter plane $Z_{+}^{2}$ with a step set that is a subset of…
The problem of a random walk on a finite triangular lattice with a single interior source point and zig-zag absorbing boundaries is solved exactly. This problem has been previously considered intractable.
In this paper, following the recent paper on Walk/Zeta Correspondence by the first author and his coworkers, we compute the zeta function for the three- and four-state quantum walk and correlated random walk, and the multi-state random walk…
The study of lattice walks restricted to the first quadrant has shed a lot of interest in the past twenty years. In particular, there has been an important effort to classify models of weighted walks with small steps with respect to the…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
We study walk-based centrality measures for time-ordered network sequences. For the case of standard dynamic walk-counting, we show how to derive and compute centrality measures induced by analytic functions. We also prove that dynamic Katz…
We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June…