ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2406.07574
  4. Cited By
Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering

Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering

4 June 2024
Mitchell Black
Lucy Lin
A. Nayyeri
Weng-Keen Wong
ArXivPDFHTML

Papers citing "Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering"

5 / 5 papers shown
Title
Understanding Oversquashing in GNNs through the Lens of Effective
  Resistance
Understanding Oversquashing in GNNs through the Lens of Effective Resistance
Mitchell Black
Qingsong Wang
A. Nayyeri
Yusu Wang
53
65
0
14 Feb 2023
Rethinking the Expressive Power of GNNs via Graph Biconnectivity
Rethinking the Expressive Power of GNNs via Graph Biconnectivity
Bohang Zhang
Shengjie Luo
Liwei Wang
Di He
13
121
0
23 Jan 2023
Affinity-Aware Graph Networks
Affinity-Aware Graph Networks
A. Velingker
A. Sinop
Ira Ktena
Petar Velickovic
Sreenivas Gollapudi
GNN
63
16
0
23 Jun 2022
Large Scale Spectral Clustering Using Approximate Commute Time Embedding
Large Scale Spectral Clustering Using Approximate Commute Time Embedding
N. Khoa
Sanjay Chawla
AI4TS
57
27
0
19 Nov 2011
A Tutorial on Spectral Clustering
A Tutorial on Spectral Clustering
U. V. Luxburg
173
10,497
0
01 Nov 2007
1