{"total":36,"rows":[{"id":"2202.07179","title":"G-Mixup: Graph Data Augmentation for Graph Classification","created":"2022-02-15","cited_by_count":146,"area":null},{"id":"2310.09192","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","created":"2023-10-13","cited_by_count":45,"area":null},{"id":"2110.02753","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","created":"2021-10-06","cited_by_count":21,"area":null},{"id":"2211.03329","title":"Implicit Graphon Neural Representation","created":"2022-11-07","cited_by_count":19,"area":null},{"id":"2301.12721","title":"Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport","created":"2023-01-30","cited_by_count":15,"area":null},{"id":"2306.08854","title":"A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening","created":"2023-06-15","cited_by_count":15,"area":null},{"id":"2312.13583","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","created":"2023-12-21","cited_by_count":13,"area":null},{"id":"2505.13893","title":"InfiGFusion: Graph-on-Logits Distillation via Efficient Gromov-Wasserstein for Model Fusion","created":"2025-05-20","cited_by_count":12,"area":null},{"id":"2209.08223","title":"Joint Network Topology Inference via a Shared Graphon Model","created":"2022-09-17","cited_by_count":11,"area":null},{"id":"2303.06595","title":"A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data","created":"2023-03-12","cited_by_count":11,"area":null},{"id":"2410.17464","title":"Scalable Implicit Graphon Learning","created":"2024-10-22","cited_by_count":9,"area":null},{"id":"2212.08171","title":"Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphs","created":"2022-12-15","cited_by_count":8,"area":null},{"id":"2302.04610","title":"Outlier-Robust Gromov-Wasserstein for Graph Data","created":"2023-02-09","cited_by_count":6,"area":null},{"id":"2303.05978","title":"Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem","created":"2023-03-10","cited_by_count":6,"area":null},{"id":"2105.14244","title":"Learning Graphon Autoencoders for Generative Graph Modeling","created":"2021-05-29","cited_by_count":5,"area":null},{"id":"2501.12595","title":"A Unified Invariant Learning Framework for Graph Classification","created":"2025-01-22","cited_by_count":5,"area":null},{"id":"2505.14170","title":"Nonparametric Teaching for Graph Property Learners","created":"2025-05-20","cited_by_count":5,"area":null},{"id":"2403.12213","title":"Private graphon estimation via sum-of-squares","created":"2024-03-18","cited_by_count":3,"area":null},{"id":"2407.13251","title":"Motif-Consistent Counterfactuals with Adversarial Refinement for Graph-Level Anomaly Detection","created":"2024-07-18","cited_by_count":3,"area":null},{"id":"2407.21742","title":"HGOE: Hybrid External and Internal Graph Outlier Exposure for Graph Out-of-Distribution Detection","created":"2024-07-31","cited_by_count":3,"area":null},{"id":"2506.04206","title":"A Few Moments Please: Scalable Graphon Learning via Moment Matching","created":"2025-06-04","cited_by_count":3,"area":null},{"id":"2510.17515","title":"The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width Analysis","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2205.08115","title":"Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Data","created":"2022-05-17","cited_by_count":1,"area":null},{"id":"2510.05527","title":"Transfer Learning on Edge Connecting Probability Estimation under Graphon Model","created":"2025-10-07","cited_by_count":1,"area":null},{"id":"2102.02741","title":"Hawkes Processes on Graphons","created":"2021-02-04","cited_by_count":0,"area":null},{"id":"2309.07453","title":"SC-MAD: Mixtures of Higher-order Networks for Data Augmentation","created":"2023-09-14","cited_by_count":0,"area":null},{"id":"2402.07365","title":"A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents","created":"2024-02-12","cited_by_count":0,"area":null},{"id":"2404.08376","title":"Graph data augmentation with Gromow-Wasserstein Barycenters","created":"2024-04-12","cited_by_count":0,"area":null},{"id":"2502.00038","title":"The Spectral Barycentre of a Set of Graphs with Community Structure","created":"2025-01-26","cited_by_count":0,"area":null},{"id":"2506.06212","title":"Model-Driven Graph Contrastive Learning","created":"2025-06-06","cited_by_count":0,"area":null},{"id":"2510.03690","title":"From Moments to Models: Graphon-Mixture Learning for Mixup and Contrastive Learning","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2603.15578","title":"Low-Complexity and Consistent Graphon Estimation from Multiple Networks","created":"2026-03-16","cited_by_count":0,"area":null},{"id":"2605.28488","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.02223","title":"Network Learning with Semi-relaxed Gromov-Wasserstein","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2609.35620","title":"Attention Graphons: A Graph Limit Perspective on Graph Transformers","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.03418","title":"Rethinking Epistemic Uncertainty in Node Classification through Information Growth","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}