Papers › Dynamic Spectral Clustering with Provable Approximation Guarantee

Dynamic Spectral Clustering with Provable Approximation Guarantee

5 Jun 2024arXiv:2406.03152archive 2025-07-28

Steinar Laenen, He Sun

This paper studies clustering algorithms for dynamically evolving graphs {Gₜ}, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper proves that, under some mild condition on the cluster-structure, the clusters of the final graph G_T of n_T vertices at time T can be well approximated by a dynamic variant of the spectral clustering algorithm. The algorithm runs in amortised update time O(1) and query time o(n_T). Experimental studies on both synthetic and real-world datasets further confirm the practicality of our designed algorithm.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 7 code samples harvested from 1 repository linked to this paper: 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 7 samples from 1 repository, 4 ran (1 with no instrument failure; 3 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee officialmentioned in paperMITSyntology: 7 samples, 4 ran (3 instrument-failed) · 3 unverified 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.

Code Syntology ran Syntology

7 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · violated contract
2ran · our draft was wrong
1ran; the contract check could not run
3unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee official repository 7 samples, 4 ran (3 instrument-failed) · 3 unverified
clusters_to_labels src/spectral_clustering.py ran · violated contract MIT (permissive) · 23d2223a3acb9902 · report fixture: signature clusters:list/1/list, num_data_points:int/0/int · returned list · level recorded 2026-09-22
compute_normalized_laplacian in 6 papers src/spectral_clustering.py ran · our draft was wrong MIT (permissive) · 92414b27c51942e2 · report fixture: signature adjacency_csr:csr_matrix/2/float · returned csr_matrix · level recorded 2026-09-22
load_experiment_data in 6 papers plots/plot_mnist_emnist.py ran · our draft was wrong MIT (permissive) · c704390cd00b7a76 · report fixture: signature filenames:list/1/str · returned dict · level recorded 2026-09-24
randomize_dataset_classes knn_experiments.py ran; the contract check could not run (RAISES) · metamorphic tier: deterministic MIT (permissive) · e3f8f23915a8b687 · report fixture: signature dataset_name:str/0/str, initial_class_count:int/0/int, group_sizes:list/1/int · returned tuple · level recorded 2026-09-22
build_initial_graph src/datasets.py unverified MIT (permissive) · f4f84f3ad175586d · report
plot_spectral_clustering_results_all plots/plot_mnist_emnist.py unverified MIT (permissive) · 7a0923d1ac32ea33 · report
plot_spectral_clustering_results_all plots/plot_sbm_all.py unverified MIT (permissive) · de55ba8a8d4aa9bf · report

Tasks

Clustering

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Spectral Clustering

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