Related papers: Generating Functions of Random Walks on Graphs
We develop a novel framework for modeling diffusion on complex networks by constructing Laplacian-like operators based on walks around a graph. Our approach introduces a parametric family of walk-based Laplacians that naturally incorporate…
Consider $n$ points independently sampled from a density $p$ of class $\mathcal{C}^2$ on a smooth compact $d$-dimensional sub-manifold $\mathcal{M}$ of $\mathbb{R}^m$, and consider the generator of a random walk visiting these points…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained.…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the…
We give a new determinant expression for the characteristic polynomial of the bond scattering matrix of a quantum graph G. Also, we give a decomposition formula for the characteristic polynomial of the bond scattering matrix of a regular…
Germ order is a non-standard stochastic order defined through the comparison of the generating functions of the processes. This order was first introduced for branching random walks with a constant breeding law and independent dispersal of…
A graph generative model defines a distribution over graphs. One type of generative model is constructed by autoregressive neural networks, which sequentially add nodes and edges to generate a graph. However, the likelihood of a graph under…
In this article we obtain new expressions for the generating functions counting (non-singular) walks with small steps in the quarter plane. Those are given in terms of infinite series, while in the literature, the standard expressions use…
Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…
In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…
We study the nature of the generating series of some models of walks with small steps in the three quarter plane. More precisely, we restrict ourselves to the situation where the group is infinite, the kernel has genus one, and the step set…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
Random walk spaces are a general framework for the study of PDEs. They include as particular cases locally finite weighted connected graphs and nonlocal settings involving symmetric integrable kernels on $\mathbb{R}^N$. We are interested in…
Spatially homogeneous random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero jump probabilities at distance at most 1, with non-zero drift in the interior of the quadrant and absorbed when reaching the axes are studied. Absorption…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
We aim to describe a droplet bouncing on a vibrating bath using a simple and highly versatile model inspired from quantum mechanics. Close to the Faraday instability, a long-lived surface wave is created at each bounce, which serves as a…
We construct random Morse functions on surfaces by random walk and compute related distributions. We study the space of Morse functions through these random variables. We consider subspaces characterized by the surfaces with boundary…