Cited by 43Complex Network Analysis TechniquesGraph Theory and AlgorithmsGraph theory and applications

Inferring lockstep behavior from connectivity pattern in large graphs

Jiang, Meng, Cui, Peng, Beutel, Alex, Faloutsos, Christos, Yang, Shiqiang·2016·Knowledge and Information Systems

Integrity signals

Registry

Crossref · 10.1007/s10115-015-0883-y

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Coordinated and synchronized behaviors appear as near-fully connected communities in graphs, dense blocks in adjacency matrices, or peculiar patterns in spectral subspaces.

    “Coordinated and synchronized behaviors appear as near-fully connected communities in graphs, dense blocks in adjacency matrices, or peculiar patterns in spectral subspaces [21].”

    From A decade of social bot detection (2020) · cites this paper as [21]

The citation lists haven’t been fetched yet

References 45 · Cited by 43

Authors
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S.
Affiliations
  • Tsinghua University (CN)
  • Carnegie Mellon University (US)
Corresponding author
Jiang, Meng
Venue
Knowledge and Information Systems
Published
2015-10-15
Volume
48
Issue
2
Pages
399-428
ISSN
  • 0219-1377 (ISSN-L)
  • 0219-3116
OpenAlex
W2182891243
Cited by
43
References
45
Citations by year
2026: 1 · 2023: 5 · 2022: 2 · 2021: 7 · 2020: 6 · 2019: 6 · 2018: 9 · 2017: 5 · 2016: 2
FWCI
3.36
Type
journal article
Language
en
Open access
closed
Locations
Knowledge and Information Systems (publishedVersion)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
  • Physical Sciences › Mathematics › Geometry and Topology › Graph theory and applications
Keywords
social graphs, adjacency matrix, spectral subspaces, block structure, staircase structure, anomaly detection, bipartite graphs, directed graphs, Twitter followers, Facebook likes, patent citation networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review