相关论文: Full asymptotic expansion for orbit-summable quadr…
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 discuss a complementary asymptotic analysis of the so called minimal random walk. More precisely, we present a version of the almost sure central limit theorem as well as a generalization of the recently proposed quadratic strong laws.…
In this paper we complete the analysis begun by two of the authors in a previous work on the discrete quantum walk on the line [J. Phys. A 36:8775-8795 (2003) quant-ph/0303105 ]. We obtain uniformly convergent asymptotics for the…
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 propose a new approach for finding discrete harmonic functions in the quarter plane with Dirichlet conditions. It is based on solving functional equations that are satisfied by the generating functions of the values taken by the harmonic…
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 introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…
We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…
We consider saddle point integrals in d variables whose phase function is neither real nor purely imaginary. Results analogous to those for Laplace (real phase) and Fourier (imaginary phase) integrals hold whenever the phase function is…
In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of…
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…
We show that corner polyhedra and 3-connected Schnyder labelings join the growing list of planar structures that can be set in exact correspondence with (weighted) models of quadrant walks via a bijection due to Kenyon, Miller, Sheffield…
A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…
We reconsider the problem of even-visiting random walks in one dimension. This problem is mapped onto a non-Hermitian Anderson model with binary disorder. We develop very efficient numerical tools to enumerate and characterize even-visiting…
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate…
We consider a one-dimensional random walk $S_n$ with i.i.d. increments with zero mean and finite variance. We study the asymptotic expansion for the tail distribution $\mathbf P(\tau_x>n)$ of the first passage times…
A method to obtain all-order asymptotic results for the coefficients of perturbative expansions in zero-dimensional quantum field is described. The focus is on the enumeration of the number of skeleton or primitive diagrams of a certain QFT…
We demonstrate an alternative method for calculating the asymptotic behaviour of the discrete one-coin quantum walk on the infinite line, via the Jacobi polynomials that arise in the path integral representation. This is significantly…
The number of excursions (finite paths starting and ending at the origin) having a given number of steps and obeying various geometric constraints is a classical topic of combinatorics and probability theory. We prove that the sequence…
We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…