Related papers: Path Laplacian operators and superdiffusive proces…

In this paper we consider a generalized diffusion equation on a square lattice corresponding to Mellin transforms of the $k$-path Laplacian. In particular, we prove that superdiffusion occurs when the parameter $s$ in the Mellin transform…

In a recent breakthrough STOC~2015 paper, a continuous diffusion process was considered on hypergraphs (which has been refined in a recent JACM 2018 paper) to define a Laplacian operator, whose spectral properties satisfy the celebrated…

Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…

Diffuse interface methods have recently been introduced for the task of semi-supervised learning. The underlying model is well-known in materials science but was extended to graphs using a Ginzburg--Landau functional and the graph…

Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some conventional notions of apparently different…

Normal and anomalous diffusion are ubiquitous in many complex systems [1] . Here, we define a time and space generalized diffusion equation (GDE), which uses fractional-time derivatives and transformed d-path Laplacian operators on…

Let $G$ be a simple graph with $n$ vertices and let $$C(G;x)=\sum_{k=0}^n(-1)^{n-k}c(G,k)x^k$$ denote the Laplacian characteristic polynomial of $G$. Then if the size $|E(G)|$ is large compared to the maximum degree $\Delta(G)$, Laplacian…

In this article, we consider the manifold learning problem when the data set is invariant under the action of a compact Lie group $K$. Our approach consists in augmenting the data-induced graph Laplacian by integrating over the $K$-orbits…

Existing approaches for diffusion on graphs, e.g., for label propagation, are mainly focused on isotropic diffusion, which is induced by the commonly-used graph Laplacian regularizer. Inspired by the success of diffusivity tensors for…

Substituting each edge of a simple connected graph $G$ by a path of length 1 and $k$ paths of length 5 generates the $k$-hexagonal graph $H^k(G)$. Iterative graph $H^k_n(G)$ is produced when the preceding constructions are repeated $n$…

The celebrated Cheeger's Inequality establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the adjacency…

Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random…

We prove well-posedness for very general linear wave- and diffusion equations on compact or non-compact metric graphs allowing various different conditions in the vertices. More precisely, using the theory of strongly continuous operator…

The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural…

We analyze the asymptotic behavior of general first order Laplacian processes on digraphs. The most important ones of these are diffusion and consensus with both continuous and discrete time. We treat diffusion and consensus as dual…

We consider an arbitrary selfadjoint operator on a separable Hilbert space. To this operator we construct an expansion in generalized eigenfunctions in which the original Hilbert space is decomposed as a direct integral of Hilbert spaces…

In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely,…

For a finite graph, we establish natural isomorphisms between eigenspaces of a Laplace operator acting on functions on the edges and eigenspaces of a transfer operator acting on functions on one-sided infinite non-backtracking paths.…

We describe operators driving the time evolution of singular diffusion on finite graphs whose vertices are allowed to carry masses. The operators are defined by the method of quadratic forms on suitable Hilbert spaces. The model also covers…

We establish the representation of general regular diffusions on star-shaped graphs as time-changed Walsh Brownian motions. These are regular continuous Markov processes described locally by a family generalized second order differential…