HiGen: Hierarchical Graph Generative Networks

Mahdi Karami
5/30/2023
cs.LGcs.SI

Official code: Karami-m/HiGen_main (10 stars, MIT, last commit 2024-04-09).

Abstract

Most real-world graphs exhibit a hierarchical structure, which is often overlooked by existing graph generation methods. To address this limitation, we propose a novel graph generative network that captures the hierarchical nature of graphs and successively generates the graph sub-structures in a coarse-to-fine fashion. At each level of hierarchy, this model generates communities in parallel, followed by the prediction of cross-edges between communities using separate neural networks. This modular approach enables scalable graph generation for large and complex graphs. Moreover, we model the output distribution of edges in the hierarchical graph with a multinomial distribution and derive a recursive factorization for this distribution. This enables us to generate community graphs with integer-valued edge weights in an autoregressive manner. Empirical studies demonstrate the effectiveness and scalability of our proposed generative model, achieving state-ofthe-art performance in terms of graph quality across various benchmark datasets. The code is available at https://github.com/Karami-m/HiGen_main.

View on arXivView PDF

Code Implementations(1)

MIT

The code of the paper: M. Karami, “HiGen: Hierarchical Graph Generative Networks”, arXiv preprint arxiv:2305.19337

102C++, PythonOct 2, 20232 years agoMIT

Similar Papers

Cite this paper

@article{karami2023higen,
  title  = {HiGen: Hierarchical Graph Generative Networks},
  author = {Mahdi Karami},
  year   = {2023},
  eprint = {2305.19337},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.19337v3},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.19337.svg)](https://codeofpaper.com/paper/2305.19337)

Discussion