BiWeighted Regular Grid Graphs—A New Class of Graphs for Which Graph Spectral Clustering is Applicable in Analytical Form
摘要
This paper presents a closed form solution to the eigen-problem of combinatorial graph Laplacian for a new type of regular grid graphs - biweighted grid graphs. Biweighted grid graphs differ from ordinary ones in that the weights along a single dimension are altering which adds complexity to the eigen-solutions and makes the graphs better test-bed for potential applications.