Fiedler¿s Clustering on m¿dimensional Lattice

S Trajanovski; PFA Van Mieghem

Fiedler¿s Clustering on m¿dimensional Lattice

Network Architectures and Services

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

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

Original language	Undefined/Unknown
Title of host publication	Proceedings of 3rd international workshop on optimal network Topologies
Editors	s.n.
Place of Publication	s.l.
Publisher	s.n.
Pages	1-8
Number of pages	8
Publication status	Published - 2010
Event	Proceedings of 3rd international workshop on optimal network Topologies, Barcelona, Spain - s.l. Duration: 9 Jun 2010 → 11 Jun 2010

Publication series

Name
Publisher	s.n.

Conference

Conference	Proceedings of 3rd international workshop on optimal network Topologies, Barcelona, Spain
Period	9/06/10 → 11/06/10

Keywords

Conf.proc. > 3 pag

Cite this

@inproceedings{4560d2fa03e14561876d5c61e981f43c,

title = "Fiedler¿s Clustering on m¿dimensional Lattice",

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

keywords = "Conf.proc. > 3 pag",

author = "S Trajanovski and {Van Mieghem}, PFA",

year = "2010",

language = "Undefined/Unknown",

publisher = "s.n.",

pages = "1--8",

editor = "s.n.",

booktitle = "Proceedings of 3rd international workshop on optimal network Topologies",

note = "Proceedings of 3rd international workshop on optimal network Topologies, Barcelona, Spain ; Conference date: 09-06-2010 Through 11-06-2010",

}

TY - GEN

T1 - Fiedler¿s Clustering on m¿dimensional Lattice

AU - Trajanovski, S

AU - Van Mieghem, PFA

PY - 2010

Y1 - 2010

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

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

KW - Conf.proc. > 3 pag

M3 - Conference contribution

SP - 1

EP - 8

BT - Proceedings of 3rd international workshop on optimal network Topologies

A2 - s.n., null

PB - s.n.

CY - s.l.

T2 - Proceedings of 3rd international workshop on optimal network Topologies, Barcelona, Spain

Y2 - 9 June 2010 through 11 June 2010

ER -