Papers › Combinatorial Complex Score-based Diffusion Modelling through Stochastic Differential Equations

Combinatorial Complex Score-based Diffusion Modelling through Stochastic Differential Equations

7 Jun 2024arXiv:2406.04916archive 2025-07-28

Adrien Carrel

Graph structures offer a versatile framework for representing diverse patterns in nature and complex systems, applicable across domains like molecular chemistry, social networks, and transportation systems. While diffusion models have excelled in generating various objects, generating graphs remains challenging. This thesis explores the potential of score-based generative models in generating such objects through a modelization as combinatorial complexes, which are powerful topological structures that encompass higher-order relationships. In this thesis, we propose a unified framework by employing stochastic differential equations. We not only generalize the generation of complex objects such as graphs and hypergraphs, but we also unify existing generative modelling approaches such as Score Matching with Langevin dynamics and Denoising Diffusion Probabilistic Models. This innovation overcomes limitations in existing frameworks that focus solely on graph generation, opening up new possibilities in generative AI. The experiment results showed that our framework could generate these complex objects, and could also compete against state-of-the-art approaches for mere graph and molecule generation tasks.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

AdrienC21/CCSD officialpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations (arXiv:2202.02514; that paper's own run record: 14 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 12 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

DenoisingGraph Generation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

DiffusionFocus

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