MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Engineering Systems Division
  • Engineering Systems Division (ESD) Working Paper Series
  • View Item
  • DSpace@MIT Home
  • Engineering Systems Division
  • Engineering Systems Division (ESD) Working Paper Series
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An Algorithm and Metric for Network Decomposition from Similarity Matrices: Application to Positional Analyses

Author(s)
Hsieh, Mo-Han; Magee, Christopher L.
Thumbnail
Downloadesd-wp-2007-13.pdf (307.9Kb)
Metadata
Show full item record
Abstract
We present an algorithm for decomposing a social network into an optimal number of structurally equivalent classes. The k-means method is used to determine the best decomposition of the social network for various numbers of subgroups. The best number of subgroups into which to decompose a network is determined by minimizing the intra-cluster variance of similarity subject to the constraint that the improvement in going to more subgroups is better than a random network would achieve. We also describe a decomposability metric that assesses how closely the derived decomposition approaches an ideal network having only structurally equivalent classes. Three well known network data sets were used to demonstrate the algorithm and decomposability metric. These demonstrations indicate the utility of the approach and suggest how it can be used in a complementary way to the Generalized Blockmodeling.
Date issued
2007-02
URI
http://hdl.handle.net/1721.1/102890
Publisher
Massachusetts Institute of Technology. Engineering Systems Division
Series/Report no.
ESD Working Papers;ESD-WP-2007-13

Collections
  • Engineering Systems Division (ESD) Working Paper Series

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.