Related papers: Non-Markovian heat flows on directed hypergraphs
We study diffusions, variational principles and associated boundary value problems on directed graphs with natural weightings. Using random walks and exit times, we associate to certain subgraphs (domains) a pair of sequences, each of which…
In this paper, the focus is on the reconstruction of a diffusive field and the localization of the underlying driving sources on arbitrary graphs by observing a significantly smaller subset of vertices of the graph uniformly in time.…
We study the heat content for Laplacians on compact, finite metric graphs with Dirichlet conditions imposed at the "boundary" (i.e., a given set of vertices). We prove a closed formula of combinatorial flavour, as it is expressed as a sum…
Graph diffusion models achieve state-of-the-art performance in graph generation but suffer from quadratic complexity in the number of nodes -- and much of their capacity is wasted modeling the absence of edges in sparse graphs. Inspired by…
In graph signal processing, many studies assume that the underlying network is undirected. Although the digraph model is rarely adopted, it is more appropriate for many applications, especially for real world networks. In this paper, we…
We discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic…
We study the size of nodal sets of Laplacian eigenfunctions on compact Riemannian manifolds without boundary and recover the currently optimal lower bound by comparing the heat flow of the eigenfunction with that of an artifically…
We establish basic properties of the heat flow on entire holomorphic functions that have order at most 2. We then look specifically at the action of the heat flow on the Gaussian analytic function (GAF). We show that applying the heat flow…
Dynamical processes on networks are currently being considered in different domains of cross-disciplinary interest. Reaction-diffusion systems hosted on directed graphs are in particular relevant for their widespread applications, from…
We propose a new fractional Laplacian for bounded domains, expressed as a conservation law and thus particularly suited to finite-volume schemes. Our approach permits the direct prescription of no-flux boundary conditions. We first show the…
We develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a sub-Riemannian metric. In particular, we develop the thermodynamic formalism and show that, under…
The formulation of combinatorial differential forms, proposed by Forman for analysis of topological properties of discrete complexes, is extended by defining the operators required for analysis of physical processes dependent on scalar…
Transformers were originally proposed as a sequence-to-sequence model for text but have become vital for a wide range of modalities, including images, audio, video, and undirected graphs. However, transformers for directed graphs are a…
We develop an index theory for variational problems on noncompact quantum graphs. The main results are a spectral flow formula, relating the net change of eigenvalues to the Maslov index of boundary data, and a Morse index theorem, equating…
We consider a generalization of the diffusion equation on graphs. This generalized diffusion equation gives rise to both normal and superdiffusive processes on infinite one-dimensional graphs. The generalization is based on the $k$-path…
The dynamics of information diffusion within graphs is a critical open issue that heavily influences graph representation learning, especially when considering long-range propagation. This calls for principled approaches that control and…
We consider graph diffusion processes constructed from finite i.i.d. samples drawn from an unknown manifold embedded in ambient Euclidean space, where the graph affinity is defined by an ambient Gaussian kernel matrix. We show that the…
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…
The main objective of the present work is to study the negative spectrum of (differential) Laplace operators on metric graphs as well as their resolvents and associated heat semigroups. We prove an upper bound on the number of negative…
This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…