BiGG-E is an autoregressive generative model that jointly samples graph topology and positive edge weights with O((n+m) log n) complexity.
Finally, we note that for graph generation, the treesTu must be constructed sequentially
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Scalable Generative Modeling of Weighted Graphs
BiGG-E is an autoregressive generative model that jointly samples graph topology and positive edge weights with O((n+m) log n) complexity.