arXiv CS
open access
Scalable Hierarchical Graph Generation via Soft Community Structure
Generating large attributed graphs requires reproducing the topology, generating attributes jointly with the structure, and remaining scalable. Many real-world graphs exist as a single large graph, so a generative model has to generalize from the one graph it is fit on, without independent samples.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scalable Hierarchical Graph Generation via Soft Community Structure#1249587
- Towards Modality-imbalanced Federated Graph Learning: A Data Synthesis-based Approach#290587
- From Graphs to Feeders: Constraint-Guided Diffusion for Rule-Compliant Feeder Generation#1077950
- GraphLoom: Reliability-Calibrated Graph Evidence Routing for Multimodal KG-RAG#612486
- GraphLoom: Reliability-Calibrated Graph Evidence Routing for Multimodal KG-RAG#611009
Record · ID 1242771
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive