Unified Statistical Theory of Spectral Graph Analysis
Subhadeep Mukhopadhyay

TL;DR
This paper presents a universal statistical framework for spectral graph analysis by reformulating it as a nonparametric function estimation problem, unifying various existing techniques under a single formalism.
Contribution
It introduces a simple, universal statistical theory that encompasses most spectral graph analysis methods through a unified nonparametric approach.
Findings
Provides a formalism that unifies spectral graph techniques
Recasts spectral analysis as nonparametric function estimation
Simplifies understanding of spectral methods
Abstract
The goal of this paper is to show that there exists a simple, yet universal statistical logic of spectral graph analysis by recasting it into a nonparametric function estimation problem. The prescribed viewpoint appears to be good enough to accommodate most of the existing spectral graph techniques as a consequence of just one single formalism and algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Topological and Geometric Data Analysis · Graph theory and applications
