Pith. Sign in

RECORD

Multi-scale Community Detection in Temporal Networks Using Spectral Graph Wavelets

Methodology · Submitted 14 Aug 2017

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim The advantage of TMSCD is the automated selection of relevant scales at which communities should be sought.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1708.04060 (version 1)
Pith ID27Z6V4LC, Pith's permanent record of this paper and its review
CitationGiovanni Montana, Zhana Kuncheva. "Multi-scale Community Detection in Temporal Networks Using Spectral Graph Wavelets." arXiv:1708.04060 (2017). https://pith.science/paper/27Z6V4LC
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,524 input tokens.

What the abstract itself states, as probabilities: claims first 0.13 · states limitation 0.06 · human participants 0.03 · controlled comparison 0.58 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.93 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Spectral graph wavelets introduce a notion of scale in networks, and are thus used to obtain a local view of the network from each node. By carefully constructing a wavelet filter function for these wavelets, a multi-scale community detection method for monoplex networks has already been developed. This construction takes advantage of the partitioning properties of the network Laplacian. In this paper we elaborate on a novel method which uses spectral graph wavelets to detect multi-scale communities in temporal networks. To do this we extend the definition of spectral graph wavelets to temporal networks by adopting a multilayer framework. We use arguments from Perturbation Theory to investigate the spectral properties of the supra-Laplacian matrix for clustering purposes in temporal networks. Using these properties, we construct a new wavelet filter function, which attenuates the influence of uninformative eigenvalues and centres the filter around eigenvalues which contain information on the coarsest description of prevalent community structures over time. We use the spectral graph wavelets as feature vectors in a connectivity-constrained clustering procedure to detect multi-scale communities at different scales, and refer to this method as Temporal Multi-Scale Community Detection (TMSCD). We validate the performance of TMSCD and a competing methodology on various benchmarks. The advantage of TMSCD is the automated selection of relevant scales at which communities should be sought.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Spectral graph wavelets introduce a notion of scale in networks, and are thus used to obtain a local view of the network from each node. background 1.00 0.09 0.02 asserted 1.00
s1 By carefully constructing a wavelet filter function for these wavelets, a multi-scale community detection method for monoplex networks has already been developed. background 0.99 0.08 0.03 asserted 1.00
s2 This construction takes advantage of the partitioning properties of the network Laplacian. background 0.95 0.10 0.02 asserted 1.00
s3 In this paper we elaborate on a novel method which uses spectral graph wavelets to detect multi-scale communities in temporal networks. contribution 1.00 0.79 0.11 asserted 0.98
s4 To do this we extend the definition of spectral graph wavelets to temporal networks by adopting a multilayer framework. method 0.86 0.88 0.04 asserted 1.00
s5 We use arguments from Perturbation Theory to investigate the spectral properties of the supra-Laplacian matrix for clustering purposes in temporal networks. method 0.95 0.88 0.03 asserted 0.96
s6 Using these properties, we construct a new wavelet filter function, which attenuates the influence of uninformative eigenvalues and centres the filter around eigenvalues which contain information on the coarsest description of prevalent community structures over time. method 0.96 0.94 0.10 asserted 1.00
s7 We use the spectral graph wavelets as feature vectors in a connectivity-constrained clustering procedure to detect multi-scale communities at different scales, and refer to this method as Temporal Multi-Scale Community Detection (TMSCD). method 0.86 0.94 0.19 asserted 0.99
s8 We validate the performance of TMSCD and a competing methodology on various benchmarks. method 0.65 0.93 0.06 asserted 0.91
s9 The advantage of TMSCD is the automated selection of relevant scales at which communities should be sought. result 0.56 0.81 0.46 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.84.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Spectral graph wavelets introduce a notion of scale in networks, and are thus used to obtain a local view of the network from each node. By carefully constructing a wavelet filter function for these wavelets, a multi-scale community detection method for monoplex networks has already been developed. This construction takes advantage of the partitioning properties of the network Laplacian. In this paper we elaborate on a novel method which uses spectral graph wavelets to detect multi-scale communities in temporal networks. To do this we extend the definition of spectral graph wavelets to temporal networks by adopting a multilayer framework. We use arguments from Perturbation Theory to investigate the spectral properties of the supra-Laplacian matrix for clustering purposes in temporal networks. Using these properties, we construct a new wavelet filter function, which attenuates the influence of uninformative eigenvalues and centres the filter around eigenvalues which contain information on the coarsest description of prevalent community structures over time. We use the spectral graph wavelets as feature vectors in a connectivity-constrained clustering procedure to detect multi-scale communities at different scales, and refer to this method as Temporal Multi-Scale Community Detection (TMSCD). We validate the performance of TMSCD and a competing methodology on various benchmarks. The advantage of TMSCD is the automated selection of relevant scales at which communities should be sought.

Human review
How the literature uses it

Papers whose main result relates to this one's

How each label was checked · JSON

Found among the papers closest to this one by title and main claim. Pith's classifier compared each pair's main results and a second model family confirmed the relation; checked against two further families, shown conflicts agreed 118 times in 120 and shown same results 218 times in 239. The quoted sentence is the other paper's main claim.

States the same result 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.