Spectral properties of the resistance Laplacian with applications to data clustering and anomaly detection

Abstract

The resistance Laplacian is a graph matrix associated with the effective resistance metric and provides a global counterpart of the classical graph Laplacian. Although it inherits several fundamental properties of the ordinary Laplacian, including a connected graph partitioning theorem analogous to that of Fiedler, its intrinsic spectral structure has remained largely unexplored. In this paper, we develop a structural theory of the resistance Laplacian. We derive a canonical decomposition that separates its intrinsic, average, and deviation components, thereby revealing how the global geometry induced by effective resistance differs from the local geometry encoded by the ordinary Laplacian. Building upon this decomposition, we establish several structural and spectral properties of the associated deviation operator, obtain variational characterizations of the largest eigenvalue and its corresponding eigenspace, and express the resistance Laplacian in Laplacian coordinates, thereby elucidating the relationship between the eigenspaces of the two operators. Finally, we formulate resistance-based graph partitioning objectives whose spectral relaxations recover the dominant eigenvector of the resistance Laplacian, providing a variational interpretation of the connected partition theorem. Experimental results on synthetic and real-life datasets demonstrate the effectiveness of the proposed framework for graph partitioning, data clustering, and exploratory anomaly detection.

Spectral properties of the magnetic Robin Laplacian on curvilinear half-plane
Diana Barseghyan, Baruch Schneider, Yifan Zhang
arXiv3 Sep 2026PreprintCC BY-NC-ND 4.0Full textAnalysis & PDEs Mathematical physicsarXiv
Fundamental solutions of the fractional p-Laplacian in cone-like domains, with applications to Liouville-type theorems and global Hölder regularity
Reshmi Biswas, Alexander Quaas
arXiv4 Nov 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv
Community Detection using the Edge Laplacian Dynamics vis-a-vis Ricci Flow
Pratibha Bhandari, Soumyendu Raha
arXiv30 Sep 2026PreprintCC BY 4.0Full textDynamical systemsarXiv
Laplacian U-Processes for Multiple Change-Point Detection in Dependent Text Networks: An Application to Historical Chinese Articles
Fanghua Chen, Yizhou Cai, Lu zhou +1
arXiv16 Sep 2026PreprintarXiv licenceFull textStatisticsarXiv
A new class of nonlocal operators: the fractional logarithmic p-Laplacian and its properties
Anouar Bahrouni, Abdelhamid Gouasmia, Hichem Hajaiej +1
arXiv24 Sep 2026PreprintCC BY 4.0Full textAnalysis & PDEsarXiv

Cite

BibTeX RIS

BibTeX

@misc{deshpande2026spectral,
  title = {{Spectral properties of the resistance Laplacian with applications to data clustering and anomaly detection}},
  author = {Priyavrat Deshpande and Gargi Lather},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.04768},
  eprint = {2609.04768},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.04768},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - Spectral properties of the resistance Laplacian with applications to data clustering and anomaly detection
AU  - Priyavrat Deshpande
AU  - Gargi Lather
PY  - 2026
DA  - 2026/09/04
PB  - arXiv
DO  - 10.48550/arxiv.2609.04768
UR  - https://arxiv.org/abs/2609.04768
AB  - The resistance Laplacian is a graph matrix associated with the effective resistance metric and provides a global counterpart of the classical graph Laplacian. Although it inherits several fundamental properties of the ordinary Laplacian, including a connected graph partitioning theorem analogous to that of Fiedler, its intrinsic spectral structure has remained largely unexplored. In this paper, we develop a structural theory of the resistance Laplacian. We derive a canonical decomposition that separates its intrinsic, average, and deviation components, thereby revealing how the global geometry induced by effective resistance differs from the local geometry encoded by the ordinary Laplacian. Building upon this decomposition, we establish several structural and spectral properties of the associated deviation operator, obtain variational characterizations of the largest eigenvalue and its corresponding eigenspace, and express the resistance Laplacian in Laplacian coordinates, thereby elucidating the relationship between the eigenspaces of the two operators. Finally, we formulate resistance-based graph partitioning objectives whose spectral relaxations recover the dominant eigenvector of the resistance Laplacian, providing a variational interpretation of the connected partition theorem. Experimental results on synthetic and real-life datasets demonstrate the effectiveness of the proposed framework for graph partitioning, data clustering, and exploratory anomaly detection.
ER  -

Abstract

Related

Cite