Browse State-of-the-Art › Subgraph Counting
Subgraph Counting
8 papers with code · 0 benchmarks · 1 dataset archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
1 dataset whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 17 · with a code link: 8 · where Syntology ran a sample: 2 (2 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 (2 of 17 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 17 of 17, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “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 figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. 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); hover it for the repositories the samples that ran came from.
-
24 Jun 2025 1 repository listedRecent advances in graph databases (GDBs) have been driving interest in large-scale analytics, yet current systems fail to support higher-order (HO) interactions beyond first-order (one-hop) relations, which are crucial…
-
16 Jan 2024 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 3 unverified (of 3 harvested samples) · 3 pointer-only (licence)Specifically, we identify a fundamental expressivity measure termed homomorphism expressivity, which quantifies the ability of GNN models to count graphs under homomorphism.
-
12 Dec 2023 1 repository listedWe suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy.
-
16 Aug 2023 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)We introduce DeSCo, a scalable neural deep subgraph counting pipeline, designed to accurately predict both the count and occurrence position of queries on target graphs post single training.
-
16 Aug 2023 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified (of 12 harvested samples) · 12 pointer-only (licence)We perform the first adversarial robustness study into Graph Neural Networks (GNNs) that are provably more powerful than traditional Message Passing Neural Networks (MPNNs).
-
31 May 2023 1 repository listedWe focus on the specific problem of subgraph counting and give localized versions of k-WL for any k.
-
13 Nov 2022 1 repository listedSpecifically, we propose a weighted sampling algorithm called WSD for estimating the subgraph count in a fully dynamic graph stream, which samples the edges based on their weights that indicate their importance and…
-
13 Jun 2022 1 repository listedA wide range of models have been proposed for Graph Generative Models, necessitating effective methods to evaluate their quality.
-
Studying and Improving Graph Neural Network-based Motif Estimation30 May 2025 0 repositories listedGraph Neural Networks (GNNs) are a predominant method for graph representation learning.
-
BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs15 Apr 2025 0 repositories listedSubgraph counting the task of determining the number of instances of a query pattern within a large graph lies at the heart of many critical applications, from analyzing financial networks and transportation systems to…
-
Homomorphism Expressivity of Spectral Invariant Graph Neural Networks1 Mar 2025 0 repositories listedGraph spectra are an important class of structural features on graphs that have shown promising results in enhancing Graph Neural Networks (GNNs).
-
Revisiting Graph Neural Networks on Graph-level Tasks: Comprehensive Experiments, Analysis, and Improvements1 Jan 2025 0 repositories listedGraphs are essential data structures for modeling complex interactions in domains such as social networks, molecular structures, and biological systems.
-
Discovering Motifs to Fingerprint Multi-Layer Networks: a Case Study on the Connectome of C. Elegans9 Aug 2024 0 repositories listedMotif discovery is a powerful and insightful method to quantify network structures and explore their function.
-
Representation Learning for Frequent Subgraph Mining22 Feb 2024 0 repositories listedIdentifying frequent subgraphs, also called network motifs, is crucial in analyzing and predicting properties of real-world networks.
-
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters29 Sep 2023 0 repositories listedSeminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the k-dimensional Weisfeiler-Leman (kWL) test, a widely-recognized…
-
The Expressive Power of Graph Neural Networks: A Survey16 Aug 2023 0 repositories listedGraph neural networks (GNNs) are effective machine learning models for many graph-related applications.
-
Two-level Graph Neural Network3 Jan 2022 0 repositories listedGraph Neural Networks (GNNs) are recently proposed neural network structures for the processing of graph-structured data.
Syntology lines on 3 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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