Abstract
dc:description.abstractIn this thesis, we consider a new random walks-based method for measuring clustering on finite graphs. The method is versatile and can provide valuable insight into the locations of centers of clusters and outliers. Some results and applications are discussed.
Degree
thesis:*- Grantor dc:publisher
- Wake Forest University
- Year dc:date.issued
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Gao, Mingyue
Subjects
dc:subject × 1Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/10339/39291
- OAI identifier oai:identifier
- oai:wakespace.lib.wfu.edu:10339/39291