Papers › Encoding Robust Representation for Graph Generation

Encoding Robust Representation for Graph Generation

28 Sep 2018arXiv:1809.10851archive 2025-07-28

Dongmian Zou, Gilad Lerman

Generative networks have made it possible to generate meaningful signals such as images and texts from simple noise. Recently, generative methods based on GAN and VAE were developed for graphs and graph signals. However, the mathematical properties of these methods are unclear, and training good generative models is difficult. This work proposes a graph generation model that uses a recent adaptation of Mallat's scattering transform to graphs. The proposed model is naturally composed of an encoder and a decoder. The encoder is a Gaussianized graph scattering transform, which is robust to signal and graph manipulation. The decoder is a simple fully connected network that is adapted to specific tasks, such as link prediction, signal generation on graphs and full graph and signal generation. The training of our proposed system is efficient since it is only applied to the decoder and the hardware requirements are moderate. Numerical results demonstrate state-of-the-art performance of the proposed system for both link prediction and graph and signal generation.

PaperPDFCode

Code

dmzou/SCAT officialmentioned in papertf report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

DecoderGraph GenerationLink Prediction

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction Citeseer (biased evaluation) SCAT (half of negative examples with 0 features) AP 97.57 #2 of 2 Archive leaderboard report
Link Prediction Citeseer (biased evaluation) SCAT (half of negative examples with 0 features) AUC 97.27 #2 of 2 Archive leaderboard report
Link Prediction Cora (biased evaluation) SCAT (half of negative examples with 0 features) AP 94.63 #2 of 2 Archive leaderboard report
Link Prediction Cora (biased evaluation) SCAT (half of negative examples with 0 features) AUC 94.48 #2 of 2 Archive leaderboard report
Link Prediction Pubmed (biased evaluation) SCAT (half of negative examples with 0 features) AP 97.19 #2 of 2 Archive leaderboard report
Link Prediction Pubmed (biased evaluation) SCAT (half of negative examples with 0 features) AUC 97.52 #2 of 2 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections