{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_3985"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_3985","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Edge impact in graphs and social network matrix completion","abstract":"Every graph G can be associated with many well-known invariant properties along with their corresponding values. A framework is proposed to measure the change in any particular invariant upon addition of a new edge $e$ in the resulting graph G+e. In graphs, the P-impact of an edge e is the `magnitude' of the difference between the values of the invariant P in graphs G+e from G. Several famous invariants are explored and a proof towards optimal edge addition for distance-impact in trees is given. A natural application to measuring the impact of edge addition to a graph is that of link prediction. An efficient algorithm for link prediction even with cold-start vertices using a subspace sharing method that decouples matrix completion and side information transduction is presented. This method is extended to predict ratings in user-item recommender systems where both may be cold-start.","abstract_html":"Every graph G can be associated with many well-known invariant properties along with their corresponding values. A framework is proposed to measure the change in any particular invariant upon addition of a new edge $e$ in the resulting graph G+e. In graphs, the P-impact of an edge e is the `magnitude&#x27; of the difference between the values of the invariant P in graphs G+e from G. Several famous invariants are explored and a proof towards optimal edge addition for distance-impact in trees is given. A natural application to measuring the impact of edge addition to a graph is that of link prediction. An efficient algorithm for link prediction even with cold-start vertices using a subspace sharing method that decouples matrix completion and side information transduction is presented. This method is extended to predict ratings in user-item recommender systems where both may be cold-start.","abstract_has_math":true,"creators":["Ross, Dennis"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Esfahanian, Abdol-Hossein","Tan, Pang-Ning","Xing, Guoliang","Nejadhashemi, Amir Pouyan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-11-18T18:45:11Z","subjects":["Graph theory","Invariants","Matrices"],"languages":["English"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:3985","isbn:9781339828657","isbn:1339828650","oclc:961288566","umi:10124766","local:Ross_grad.msu_0128D_14558"],"render_values":[{"text":"etd:3985","href":null,"code":true},{"text":"isbn:9781339828657","href":null,"code":true},{"text":"isbn:1339828650","href":null,"code":true},{"text":"oclc:961288566","href":null,"code":true},{"text":"umi:10124766","href":null,"code":true},{"text":"local:Ross_grad.msu_0128D_14558","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/cw39-hy43","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/cw39-hy43","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_3985","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Esfahanian, Abdol-Hossein","Tan, Pang-Ning","Xing, Guoliang","Nejadhashemi, Amir Pouyan"]},{"key":"dc:creator","label":"Author","values":["Ross, Dennis"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Text","Theses"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph theory","Invariants","Matrices"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:3985","isbn:9781339828657","isbn:1339828650","oclc:961288566","umi:10124766","local:Ross_grad.msu_0128D_14558","https://doi.org/doi:10.25335/cw39-hy43"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Every graph G can be associated with many well-known invariant properties along with their corresponding values. A framework is proposed to measure the change in any particular invariant upon addition of a new edge $e$ in the resulting graph G+e. In graphs, the P-impact of an edge e is the `magnitude' of the difference between the values of the invariant P in graphs G+e from G. Several famous invariants are explored and a proof towards optimal edge addition for distance-impact in trees is given. A natural application to measuring the impact of edge addition to a graph is that of link prediction. An efficient algorithm for link prediction even with cold-start vertices using a subspace sharing method that decouples matrix completion and side information transduction is presented. This method is extended to predict ratings in user-item recommender systems where both may be cold-start.","Thesis (Ph. D.)--Michigan State University. Computer Science, 2016","Includes bibliographical references (pages 134-142)"]},{"key":"dc:format","label":"Dc Format","values":["xv, 142 pages","application/pdf"]},{"key":"dc:title","label":"Title","values":["Edge impact in graphs and social network matrix completion"]}]}],"canonical_facts":{"dc:contributor":["Esfahanian, Abdol-Hossein","Tan, Pang-Ning","Xing, Guoliang","Nejadhashemi, Amir Pouyan"],"dc:creator":["Ross, Dennis"],"dc:date":["2016"],"dc:description":["Every graph G can be associated with many well-known invariant properties along with their corresponding values. A framework is proposed to measure the change in any particular invariant upon addition of a new edge $e$ in the resulting graph G+e. In graphs, the P-impact of an edge e is the `magnitude' of the difference between the values of the invariant P in graphs G+e from G. Several famous invariants are explored and a proof towards optimal edge addition for distance-impact in trees is given. A natural application to measuring the impact of edge addition to a graph is that of link prediction. An efficient algorithm for link prediction even with cold-start vertices using a subspace sharing method that decouples matrix completion and side information transduction is presented. This method is extended to predict ratings in user-item recommender systems where both may be cold-start.","Thesis (Ph. D.)--Michigan State University. Computer Science, 2016","Includes bibliographical references (pages 134-142)"],"dc:format":["xv, 142 pages","application/pdf"],"dc:identifier":["etd:3985","isbn:9781339828657","isbn:1339828650","oclc:961288566","umi:10124766","local:Ross_grad.msu_0128D_14558","https://doi.org/doi:10.25335/cw39-hy43"],"dc:language":["English"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Graph theory","Invariants","Matrices"],"dc:title":["Edge impact in graphs and social network matrix completion"],"dc:type":["Text","Theses"]},"updated_at":"2026-11-18T18:45:11Z"}