{"id":{"repo_id":"wfu","oai_identifier":"oai:wakespace.lib.wfu.edu:10339/39291"},"canonical_url":"https://search.dev.ndltd.org/etd/wfu/oai:wakespace.lib.wfu.edu:10339/39291","repository":{"repo_id":"wfu","name":"Wake Forest University","base_url":"https://wakespace.lib.wfu.edu/oai/request"},"display":{"title":"A Transport Redundancy Approach to Spatial Clustering","abstract":"In 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.","abstract_html":"In 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.","abstract_has_math":false,"creators":["Gao, Mingyue"],"institution":"Wake Forest University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-07-27T22:01:46Z","subjects":["Networks"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10339/39291","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Gao, Mingyue"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-07-10T08:35:35Z"]},{"key":"dc:date.issued","label":"Date","values":["2014"]},{"key":"dc:publisher","label":"Institution","values":["Wake Forest University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10339/39291"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In 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."]},{"key":"dc:title","label":"Title","values":["A Transport Redundancy Approach to Spatial Clustering"]}]}],"canonical_facts":{"dc:creator":["Gao, Mingyue"],"dc:date.accessioned":["2014-07-10T08:35:35Z"],"dc:date.issued":["2014"],"dc:description.abstract":["In 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."],"dc:identifier.uri":["http://hdl.handle.net/10339/39291"],"dc:language.iso":["en"],"dc:publisher":["Wake Forest University"],"dc:subject":["Networks"],"dc:title":["A Transport Redundancy Approach to Spatial Clustering"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T22:01:46Z"}