Methods › Graphs › Graph Models › BiGG
BiGG
Introduced by Hanjun Dai et al. in Scalable Deep Generative Modeling for Sparse Graphs
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
BiGG is an autoregressive model for generative modeling for sparse graphs. It utilizes sparsity to avoid generating the full adjacency matrix, and reduces the graph generation time complexity to O(((n + m)logn). Furthermore, during training this autoregressive model can be parallelized with O(logn) synchronization stages, which makes it much more efficient than other autoregressive models that require Ω(n). The approach is based on three key elements: (1) an O(logn) process for generating each edge using a binary tree data structure, inspired by R-MAT; (2) a tree-structured autoregressive model for generating the set of edges associated with each node; and (3) an autoregressive model defined over the sequence of nodes.
In Syntology repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). This answer is about arXiv:2006.15502, the paper the archive credits with this method.
Origin paper of this answer, arXiv:2006.15502 (its page on this site · its page on Syntology).
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 3 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 3 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 3 of 3, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
A Novel Technique for Query Plan Representation Based on Graph Neural Nets 8 May 2024 · 0 repositories · arXiv:2405.04814
-
COVRECON: Combining Genome-scale Metabolic Network Reconstruction and Data-driven Inverse Modeling to Reveal Changes in Metabolic Interaction Networks 21 Mar 2023 · 0 repositories · arXiv:2303.12526
-
Scalable Deep Generative Modeling for Sparse Graphs 28 Jun 2020 · 1 repository · arXiv:2006.15502
Tasks archive 2025-07-28
3 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Graph Generation | 1 |
| Management | 1 |
| regression | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections