Fiedler¿s Clustering on m¿dimensional Lattice

Conference paper (2010)

Authors

S. Trajanovski Network Architectures and Services - EEMCS
P.F.A. Van Mieghem Network Architectures and Services - EEMCS
Research Group
Network Architectures and Services (EEMCS) (TU Delft)
More Info
expand_more

Published Date

2010

Language

Undefined/Unknown

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Quantum & Computer Engineering

Research Group

Network Architectures and Services

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 ¿.