paper-with-me

홈 › Papers

MarkovGNN: Graph Neural Networks on Markov Diffusion

2022-02-05 · Md. Khaledur Rahman, Abhigya Agrawal, Ariful Azad

Most real-world networks contain well-defined community structures where nodes are densely connected internally within communities. To learn from these networks, we develop MarkovGNN that captures the formation and evolution of communities directly in different convolutional layers. Unlike most Graph Neural Networks (GNNs) that consider a static graph at every layer, MarkovGNN generates different stochastic matrices using a Markov process and then uses these community-capturing matrices in different layers. MarkovGNN is a general approach that could be used with most existing GNNs. We experimentally show that MarkovGNN outperforms other GNNs for clustering, node classification, and visualization tasks. The source code of MarkovGNN is publicly available at \url{https://github.com/HipGraph/MarkovGNN}.

📄 PDF Abstract BibTeX arXiv:2202.02470

Code (1)

hipgraph/markovgnn 공식 구현 pytorch

Tasks

ClusteringNode Classification

Similar Papers 제목 키워드 기반

A Markov Variation Approach to Smooth Graph Signal Interpolation

2020-01-28

In this paper we present the Markov variation, a smoothness measure which offers a probabilistic interpretation of graph signal smoothness. This measure is then used to develop an optimization framework for graph signal …

Diffusion Maps for Signal Filtering in Graph Learning

2023-12-22 · Todd Hildebrant

This paper explores the application diffusion maps as graph shift operators in understanding the underlying geometry of graph signals. The study evaluates the improvements in graph learning when using diffusion map gener…

Graph Learning

Locality Preserving Markovian Transition for Instance Retrieval

2025-06-05 · Jifei Luo, Wenzheng Wu, Hantao Yao, Lu Yu 외

Diffusion-based re-ranking methods are effective in modeling the data manifolds through similarity propagation in affinity graphs. However, positive signals tend to diminish over several steps away from the source, reduc…

Re-RankingRetrieval

Measuring Spatial Clustering via Metropolis-Hastings Diffusion Distance

2026-07-16 · Thomas Weighill, Chidinma Williams arxiv

We propose a novel measure of the discrepancy between two probability distributions $f$ and $g$ on a graph - which we call the diffusion distance - that measures the rate of convergence of $f$ to $g$ under a graph-constr…

MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering

2022-04-05 · Jun Hu, Bryan Hooi, Shengsheng Qian, Quan Fang 외

Graph Neural Networks (GNNs) have recently been utilized to build Collaborative Filtering (CF) models to predict user preferences based on historical user-item interactions. However, there is relatively little understand…

Collaborative FilteringMulti-modal RecommendationRecommendation SystemsRepresentation Learning