Fiedler¿s Clustering on m¿dimensional Lattice
Conference Paper
(2010)
Author(s)
S. Trajanovski (TU Delft - Network Architectures and Services)
Piet Mieghem (TU Delft - Network Architectures and Services)
Research Group
Network Architectures and Services
To reference this document use:
https://resolver.tudelft.nl/uuid:4560d2fa-03e1-4561-876d-5c61e981f43c
More Info
expand_more
expand_more
Publication Year
2010
Research Group
Network Architectures and Services
Pages (from-to)
1-8
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 ¿.
No files available
Metadata only record. There are no files for this record.