FINDER - FInding key players in complex Networks through DEep Reinforcement learning (Nature Machine Intelligence)

GLSearch: Maximum Common Subgraph Detection via Learning to Search

Source code for paper "TriATNE: Tripartite Adversarial Training for Network Embeddings"

Data and code for "Compressibility of complex networks" by Christopher W. Lynn and Danielle S. Bassett

Flow stability framework for dynamic community detection in temporal networks

Matlab codes necessary to compute resistive paths and communicability. Attached to the paper "Network bypasses sustain complexity"

Inference and sampling on the Hy-MMSBM probabilistic model for hypergraphs.

Generate embeddings from large-scale graph-structured data.

Experiments for the paper: link prediction using low-dimensional graph embeddings

[ICLR '25] A method for pruning nearest neighbor graphs using discrete graph curvature: https://arxiv.org/abs/2410.01149

[ICLR 2025 Spotlight] LayerDAG: A Layerwise Autoregressive Diffusion Model of Directed Acyclic Graphs

Markov Equivalence on Maximal Ancestral Graphs: A Comparative Evaluation

Official implementation of "Discover network dynamics with neural symbolic regression"