This work proposes a principled augmentation strategy based on degree-preserving edge rewiring, inspired by the configuration model, that generates alternative graph views that maintain node degrees while randomizing the graph topology.
This work shows that informative embeddings can be derived without complicated model design and gradient-based training, and suggests that informative graph embeddings can arise from carefully chosen topological transformations before any learning operation is applied.
Meng Qin, Jin-Qiang Cui, Hong-Wei Zheng et al.· 0 citations
This work introduces a graph generation method that incorporates graph-theoretic principles into the learning process and preserves both global and local characteristics of the input graph while correcting the degree distribution to avoid duplicating the original topology.
Yuliang Ji, Jie Chen, Yuan-Zhe Xi· Research in the Mathematical...· 0 citations
Experiments show that incorporating NC-LID-based regularization consistently improves reconstruction performance over the baseline without structural regularization and the method using hub-aware regularization, which highlights NC-LID as a useful structural signal for enhancing distance-based graph autoencoders in dyn...
Aleksandar Tomčić, Milos Savic, Milos Radovanovic· 0 citations
This work introduces a novel method Schreier-Coset Graph Rewiring, a group-theoretic rewiring method that augments the input graph with a Schreier-Coset graph derived from a special linear group, creating a low-resistance bypass for long-range communication.
Aryan Mishra, Randy Martinez, Lizhen Lin· arXiv.org· 0 citations
A Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of-Distribution detection (termed HGOOD), which constructs two branches to hierarchically mine graph compact semantics in a comprehensive manner and introduces a cross-branch prototype contrast that aligns the captured graph patterns with their cr...
Xuan-Ting Fan, Chen-Yu Wang, Yue-Yue Gao et al.· Proceedings of the Thirty-Fi...· 0 citations
Similarity-guided Structural Matching Learning for Graph Dataset Condensation (SSGDC) is proposed, which efficiently reduces repository size while maintaining both task performance and structural information.
Yi-Yang Zhang, Yutong Ye, Ying-Bo Zhou et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.