Fiedler’s Clustering on m-dimensional Lattice Graphs
Lists
Only you see this
Abstract
We consider the partitioning of m-dimensional lattice graphs using Fiedler’s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of the Laplacian. We examine the general m-dimensional lattice and, in particular, the special cases: the 1-dimensional path graph PN and the 2-dimensional lattice graph. We determine the size of the clusters and the number of links, which are cut by this partitioning as a function of Fiedler’s threshold.
BibTeX
@inproceedings{trajanovski2010fiedlers,
author = {Stojan Trajanovski and Piet Van Mieghem},
title = {{Fiedler’s Clustering on m-dimensional Lattice Graphs}},
booktitle = {Research},
year = {2010},
}Loading related content...