{"id":"https://openalex.org/W944123","doi":null,"title":"Robust convex relaxation for the planted clique and densest k-subgraph problems","display_name":"Robust convex relaxation for the planted clique and densest k-subgraph problems","publication_year":2013,"publication_date":"2013-05-21","ids":{"openalex":"https://openalex.org/W944123","mag":"944123"},"language":"en","primary_location":{"id":"mag:944123","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1305.4891v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1305.4891v1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000908908","display_name":"Brendan Ames","orcid":"https://orcid.org/0000-0003-0810-7956","observed_orcids":["https://orcid.org/0000-0003-0810-7956"]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Brendan Ames","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":"https://orcid.org/0000-0003-0810-7956","affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000908908"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9564999938011169,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9564999938011169,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.01119999960064888,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.008200000040233135,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planted-clique","display_name":"planted clique","score":0.906000018119812},{"id":"https://openalex.org/keywords/convex-relaxation","display_name":"convex relaxation","score":0.8370000123977661},{"id":"https://openalex.org/keywords/nuclear-norm","display_name":"nuclear norm","score":0.7490000128746033},{"id":"https://openalex.org/keywords/l1-norm","display_name":"L1 norm","score":0.7680000066757202},{"id":"https://openalex.org/keywords/exact-recovery","display_name":"exact recovery","score":0.6809999942779541},{"id":"https://openalex.org/keywords/noise-robustness","display_name":"noise robustness","score":0.6740000247955322},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.875},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7269999980926514}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7202796936035156},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6655324101448059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5999654531478882},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.588589608669281},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5063058137893677},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4718190133571625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.466374933719635},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.42714327573776245},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.42134279012680054},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38576483726501465},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.21019801497459412},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1486755907535553},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:944123","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1305.4891v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:944123","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1305.4891v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W1548168548","https://openalex.org/W1571257748","https://openalex.org/W1605711022","https://openalex.org/W1771423625","https://openalex.org/W1936234780","https://openalex.org/W1949284707","https://openalex.org/W1965656937","https://openalex.org/W1972894929","https://openalex.org/W1975442866","https://openalex.org/W1986010539","https://openalex.org/W2003753589","https://openalex.org/W2010286849","https://openalex.org/W2010601719","https://openalex.org/W2012365979","https://openalex.org/W2028126706","https://openalex.org/W2029213856","https://openalex.org/W2036836182","https://openalex.org/W2062307640","https://openalex.org/W2069488552","https://openalex.org/W2072802070","https://openalex.org/W2078758709","https://openalex.org/W2080918732","https://openalex.org/W2091602684","https://openalex.org/W2093486293","https://openalex.org/W2105693192","https://openalex.org/W2107411554","https://openalex.org/W2116616571","https://openalex.org/W2118550318","https://openalex.org/W2125690626","https://openalex.org/W2143724791","https://openalex.org/W2145096794","https://openalex.org/W2145962650","https://openalex.org/W2150718242","https://openalex.org/W2158121106","https://openalex.org/W2164278908","https://openalex.org/W2296319761","https://openalex.org/W2296616510","https://openalex.org/W2600681475","https://openalex.org/W2614891641","https://openalex.org/W2798909945","https://openalex.org/W2962704928","https://openalex.org/W2963415095","https://openalex.org/W2963798309","https://openalex.org/W3139080059","https://openalex.org/W3141222251","https://openalex.org/W4302155765","https://openalex.org/W7100540699"],"related_works":["https://openalex.org/W7099918456","https://openalex.org/W1572312821","https://openalex.org/W2933447516","https://openalex.org/W7098144578","https://openalex.org/W646298202","https://openalex.org/W2950602321","https://openalex.org/W4409365699","https://openalex.org/W4416359268","https://openalex.org/W2299718471","https://openalex.org/W2010787744"],"abstract_inverted_index":{"We":[0,14,88],"consider":[1,89],"the":[2,6,29,35,44,51,68,71,82,96,108,116,130,156],"problem":[3,17,38],"of":[4,21,53,84,133,145,158],"identifying":[5,129],"densest":[7,45,131],"k-node":[8],"subgraph":[9,132],"in":[10,67,81,136],"a":[11,75,137],"given":[12],"graph.":[13],"write":[15],"this":[16,93],"as":[18],"an":[19,102],"instance":[20],"rank-constrained":[22],"cardinality":[23],"minimization":[24],"and":[25,31,111,143],"then":[26],"relax":[27],"using":[28],"nuclear":[30],"11":[32],"norms.":[33],"Although":[34],"original":[36],"combinatorial":[37],"is":[39,99],"NP-hard,":[40],"we":[41,63],"show":[42],"that":[43,70],"k-subgraph":[46],"can":[47],"be":[48],"recovered":[49],"from":[50],"solution":[52],"our":[54,159],"convex":[55],"relaxation":[56],"for":[57,92,128,148],"certain":[58],"program":[59],"inputs.":[60],"In":[61,95,115],"particular,":[62],"establish":[64],"exact":[65],"recovery":[66,126],"case":[69],"input":[72],"graph":[73,139],"contains":[74],"single":[76],"planted":[77,109],"clique":[78,110],"plus":[79],"noise":[80,98],"form":[83],"corrupted":[85],"adjacency":[86],"relationships.":[87],"two":[90],"constructions":[91],"noise.":[94],"first,":[97],"introduced":[100],"by":[101],"adversary":[103],"deterministically":[104],"deleting":[105],"edges":[106],"within":[107],"placing":[112],"diversionary":[113],"edges.":[114],"second,":[117],"these":[118],"edge":[119],"corruptions":[120],"are":[121,140,152],"performed":[122],"at":[123],"random.":[124],"Analogous":[125],"guarantees":[127],"fixed":[134],"size":[135],"bipartite":[138],"also":[141],"established,":[142],"results":[144],"numerical":[146],"simulations":[147],"randomly":[149],"generated":[150],"graphs":[151],"included":[153],"to":[154],"demonstrate":[155],"efficacy":[157],"algorithm.":[160]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}