Abstract—We introduce the diffusion and superposition dis-tances as two metrics to compare signals supported in the nodes of a network. Both metrics consider the given vectors as initial temperature distributions and diffuse heat trough the edges of the graph. The similarity between the given vectors is determined by the similarity of the respective diffusion profiles. The superposition distance computes the instantaneous difference between the diffused signals and integrates the difference over time. The diffusion distance determines a distance between the integrals of the diffused signals. We prove that both distances define valid metrics and that they are stable to perturbations in the underlying network. We utilize numerical experiments...
International audienceThe use of the heat kernel on graphs has recently given rise to a family of so...
Motivation: The diffusion kernel is a general method for computing pairwise distances among all node...
International audienceOptimal Transport (OT) for structured data has received much attention in the ...
Abstract. This work provides the first detailed investigation of the dis-turbed diffusion scheme FOS...
This article proposes the augmentation of the adjacency model of networks for graph signal processin...
This article proposes the augmentation of the adjacency model of networks for graph signal processin...
How is the shape of a graph captured by the way heat diffuses between its nodes? The Laplacian Expon...
peer reviewedThis work proposes a graph model for networks where node collaborations can be describe...
pre-printWe propose a novel difference metric, called the graph diffusion distance (GDD), for quanti...
We propose a novel difference metric, called the graph diffusion dis-tance (GDD), for quantifying th...
With the increase in data acquisition and storage capabilities, developing efficient methods for pro...
Several models exist for diffusion of signals across biological, social, or engineered networks. How...
Diffusion processes in networks are increas-ingly used to model the spread of informa-tion and socia...
Several models exist for diffusion of signals across biological, social, or engineered networks. Ho...
International audienceThe use of the heat kernel on graphs has recently given rise to a family of so...
Motivation: The diffusion kernel is a general method for computing pairwise distances among all node...
International audienceOptimal Transport (OT) for structured data has received much attention in the ...
Abstract. This work provides the first detailed investigation of the dis-turbed diffusion scheme FOS...
This article proposes the augmentation of the adjacency model of networks for graph signal processin...
This article proposes the augmentation of the adjacency model of networks for graph signal processin...
How is the shape of a graph captured by the way heat diffuses between its nodes? The Laplacian Expon...
peer reviewedThis work proposes a graph model for networks where node collaborations can be describe...
pre-printWe propose a novel difference metric, called the graph diffusion distance (GDD), for quanti...
We propose a novel difference metric, called the graph diffusion dis-tance (GDD), for quantifying th...
With the increase in data acquisition and storage capabilities, developing efficient methods for pro...
Several models exist for diffusion of signals across biological, social, or engineered networks. How...
Diffusion processes in networks are increas-ingly used to model the spread of informa-tion and socia...
Several models exist for diffusion of signals across biological, social, or engineered networks. Ho...
International audienceThe use of the heat kernel on graphs has recently given rise to a family of so...
Motivation: The diffusion kernel is a general method for computing pairwise distances among all node...
International audienceOptimal Transport (OT) for structured data has received much attention in the ...