pith. sign in

arxiv: 1211.0053 · v2 · pith:5D4F7BI2new · submitted 2012-10-31 · 💻 cs.DM · cs.LG· cs.SI

The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains

classification 💻 cs.DM cs.LGcs.SI
keywords graphsdatagraphdomainshigh-dimensionalprocessinganalysisemerging
0
0 comments X
read the original abstract

In applications such as social, energy, transportation, sensor, and neuronal networks, high-dimensional data naturally reside on the vertices of weighted graphs. The emerging field of signal processing on graphs merges algebraic and spectral graph theoretic concepts with computational harmonic analysis to process such signals on graphs. In this tutorial overview, we outline the main challenges of the area, discuss different ways to define graph spectral domains, which are the analogues to the classical frequency domain, and highlight the importance of incorporating the irregular structures of graph data domains when processing signals on graphs. We then review methods to generalize fundamental operations such as filtering, translation, modulation, dilation, and downsampling to the graph setting, and survey the localized, multiscale transforms that have been proposed to efficiently extract information from high-dimensional data on graphs. We conclude with a brief discussion of open issues and possible extensions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification

    cs.LG 2019-07 unverdicted novelty 6.0

    ML-GCN embeds nodes via GCN, generates a label matrix in the same space, and trains with relaxed skip-gram on node-label concatenations to model correlations, reporting outperformance on graph datasets.

  2. E-PCN: Jet Tagging with Explainable Particle Chebyshev Networks Using Kinematic Features

    hep-ph 2025-12 conditional novelty 5.0

    E-PCN reaches 94.67% macro-accuracy on 10-class jet tagging by weighting graphs with angular separation, transverse momentum, momentum fraction, and invariant mass, with Grad-CAM showing the first two account for 76% ...

  3. Optimization of a partial differential equation on a complex network

    math.OC 2019-07 unverdicted novelty 4.0

    Finite element discretization, rigorous error bounds, and preconditioning are presented for optimizing PDE-constrained problems on metric graphs with sparse Dirichlet controls.