Skip to content

Graph Based Detection

Detection methods that model information propagation and social networks as graphs, then apply graph neural networks (GNNs), spectral analysis, or topological feature extraction to distinguish fake from real news. These approaches leverage the insight that fake and real news exhibit different cascade structures: depth, breadth, balance, and connectivity patterns.

Key insights

  • Network topology is diagnostic: Propagation trees, retweet graphs, and social networks exhibit structural patterns that correlate with veracity; fake news tends to spread in deeper, more unbalanced structures.
  • Graph neural networks learn structure: GNNs such as graph convolutional networks (GCNs) and graph attention networks automatically learn feature representations from graph structure without hand-engineered features.
  • Spectral methods provide interpretability: Spectral bounds and eigenvalue analysis translate abstract graph properties into interpretable cascade characteristics (branching capacity, cohesion, diffusion dynamics).

Methods and approaches

  • Graph neural networks: GCNs, RNNs on graph sequences, graph attention networks applied to cascade graphs for end-to-end learning.
  • Spectral analysis: Eigenvalue-based bounds and spectral graph theory to derive interpretable structural properties and classification features.
  • Kernel methods: Graph kernels (e.g., propagation tree kernels) measuring structural similarity between cascades.
  • Topological features: Hand-engineered features from cascade depth, breadth, maximum degree, and other graph-theoretic properties.

Key papers

See also