A Hierarchical Scale-free Graph Generator under Limited Resources
Xiaorui Qi, Yanlong Wen, and Xiaojie Yuan

TL;DR
This paper introduces a hierarchical scale-free graph generation method that operates effectively under resource constraints, using a two-stage process guided by anchor nodes and degree mixing, with proven theoretical guarantees and superior empirical performance.
Contribution
The paper presents a novel hierarchical scale-free graph generator that does not rely on training data, offering theoretical guarantees and improved distribution fitting over existing methods.
Findings
Outperforms existing strategies in fitting ground truth distributions
Provides theoretical guarantees for hierarchical generation
Effective across diverse datasets
Abstract
Graph generation is one of the most challenging tasks in recent years, and its core is to learn the ground truth distribution hiding in the training data. However, training data may not be available due to security concerns or unaffordable costs, which severely blows the learning models, especially the deep generative models. The dilemma leads us to rethink non-learned generation methods based on graph invariant features. Based on the observation of scale-free property, we propose a hierarchical scale-free graph generation algorithm. Specifically, we design a two-stage generation strategy. In the first stage, we sample multiple anchor nodes to further guide the formation of substructures, splitting the initial node set into multiple ones. Next, we progressively generate edges by sampling nodes through a degree mixing distribution, adjusting the tolerance towards exotic structures via…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Optimization and Search Problems · Caching and Content Delivery
