Related papers: Generating Functions of Random Walks on Graphs
We refine necessary and sufficient conditions for the generating series of a weighted model of a quarter plane walk to be differentially algebraic. In addition, we give algorithms based on the theory of Mordell-Weil lattices, that, for each…
In the field of enumeration of weighted walks confined to the quarter plane, it is known that the generating functions behave very differently depending on the chosen step set; in practice, the techniques used in the literature depend on…
The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of…
For $\lambda>0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda}{1+\lambda}$, otherwise continued with probability…
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…
It is a classical result due to Jacobi in algebraic combinatorics that the generating function of closed walks at a vertex $u$ in a graph $G$ is determined by the rational function \[ \frac{\phi_{G-u}(t)}{\phi_G(t)} \] where $\phi_G(t)$ is…
We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
In this work a Green function approach for scattering quantum walks is developed. The exact formula has the form of a sum over paths and always can be cast into a closed analytic expression for arbitrary topologies and position dependent…
We study a general transition operator, generated by a random walk on a graph $X$; in particular we give necessary and sufficient condition on the matrix coefficient (1-step transition probablilities) to be a bounded operator from…
In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.
Ideas of Kn\"odel and B\"ohm-Hornik about walks in certain graphs, resembling the classical symmetric random walk on the integers, are combined. All the relevant generating functions (although occasionally quite involved) are made fully…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
In the present paper, we introduce a new approach, relying on the Galois theory of difference equations, to study the nature of the generating series of walks in the quarter plane. Using this approach, we are not only able to recover many…
We link questions by Abdelkader about a class of random walks to \emph{Moran walks}.
We consider the generating function of the algebraic area of lattice walks, evaluated at a root of unity, and its relation to the Hofstadter model. In particular, we obtain an expression for the generating function of the n-th moments of…
This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…
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 give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.