{"id":"https://openalex.org/W2090304146","doi":"https://doi.org/10.1017/s0963548304006303","title":"Max Cut for Random Graphs with a Planted Partition","display_name":"Max Cut for Random Graphs with a Planted Partition","publication_year":2004,"publication_date":"2004-07-01","ids":{"openalex":"https://openalex.org/W2090304146","doi":"https://doi.org/10.1017/s0963548304006303","mag":"2090304146"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548304006303","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006303","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3CDC45B071032D5F0069DAE1BA9A1942/S0963548304006303a.pdf/div-class-title-max-cut-for-random-graphs-with-a-planted-partition-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3CDC45B071032D5F0069DAE1BA9A1942/S0963548304006303a.pdf/div-class-title-max-cut-for-random-graphs-with-a-planted-partition-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110896517","display_name":"B Bollob\u00e1s","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]},{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"B. BOLLOB\u00c1S","raw_affiliation_strings":["Trinity College, Cambridge CB2 1TQ and Department of Mathematical Sciences, University of Memphis, Memphis TN38152, USA (e-mail:","Trinity College, Cambridge CB2 1TQ and Department of Mathematical Sciences, University of Memphis, Memphis TN38152, USA (e-mail: bollobas@msci.memphis.edu)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trinity College, Cambridge CB2 1TQ and Department of Mathematical Sciences, University of Memphis, Memphis TN38152, USA (e-mail:","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"Trinity College, Cambridge CB2 1TQ and Department of Mathematical Sciences, University of Memphis, Memphis TN38152, USA (e-mail: bollobas@msci.memphis.edu)","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022035980","display_name":"Alex Scott","orcid":"https://orcid.org/0000-0003-0366-8404"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. D. SCOTT","raw_affiliation_strings":["Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK (e-mail:","Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK (e-mail: scott@math.ucl.ac.uk)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK (e-mail:","institution_ids":["https://openalex.org/I45129253"]},{"raw_affiliation_string":"Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK (e-mail: scott@math.ucl.ac.uk)#TAB#","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4343,"has_fulltext":true,"cited_by_count":41,"citation_normalized_percentile":{"value":0.92297869,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"4-5","first_page":"451","last_page":"474"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9998000264167786,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8166247010231018},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7317366003990173},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7122747898101807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6752068400382996},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5742121934890747},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.45956259965896606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44764092564582825},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4362495541572571}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8166247010231018},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7317366003990173},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7122747898101807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6752068400382996},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5742121934890747},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.45956259965896606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44764092564582825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4362495541572571}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548304006303","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006303","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3CDC45B071032D5F0069DAE1BA9A1942/S0963548304006303a.pdf/div-class-title-max-cut-for-random-graphs-with-a-planted-partition-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.176.1415","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.176.1415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.maths.ox.ac.uk/%7Escott/Papers/planted.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:181875","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/181875/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"COMBINATORICS PROBABILITY & COMPUTING , 13 (4-5) pp. 451-474. (2004)","raw_type":"Article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:3c284b3b-ab12-4883-b277-42103fa06873","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:3c284b3b-ab12-4883-b277-42103fa06873","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Journal article"}],"best_oa_location":{"id":"doi:10.1017/s0963548304006303","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006303","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3CDC45B071032D5F0069DAE1BA9A1942/S0963548304006303a.pdf/div-class-title-max-cut-for-random-graphs-with-a-planted-partition-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G734860537","display_name":null,"funder_award_id":"ITR 0225610","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7460574776","display_name":"ITR: Foundations of Hybrid and Embedded Software Systems","funder_award_id":"0225610","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2090304146.pdf","grobid_xml":"https://content.openalex.org/works/W2090304146.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1493351895","https://openalex.org/W1539191226","https://openalex.org/W1979219118","https://openalex.org/W1986010539","https://openalex.org/W1987178221","https://openalex.org/W1989042829","https://openalex.org/W2011039300","https://openalex.org/W2016776056","https://openalex.org/W2023135717","https://openalex.org/W2024128809","https://openalex.org/W2024281442","https://openalex.org/W2027048490","https://openalex.org/W2030087828","https://openalex.org/W2038225707","https://openalex.org/W2048139750","https://openalex.org/W2050883504","https://openalex.org/W2055107590","https://openalex.org/W2062307640","https://openalex.org/W2065641139","https://openalex.org/W2068871408","https://openalex.org/W2078758709","https://openalex.org/W2087226760","https://openalex.org/W2126641717","https://openalex.org/W2141003493","https://openalex.org/W2156397150","https://openalex.org/W2177539811","https://openalex.org/W2611831635","https://openalex.org/W4249343322","https://openalex.org/W4253491426"],"related_works":["https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3134869969","https://openalex.org/W2782513589","https://openalex.org/W3173312668","https://openalex.org/W4301046126","https://openalex.org/W2810695303","https://openalex.org/W3012931947","https://openalex.org/W3183075326","https://openalex.org/W2035944803"],"abstract_inverted_index":{"We":[0,56],"give":[1,58],"an":[2],"algorithm":[3,39,62],"that,":[4],"with":[5,23,32],"high":[6],"probability,":[7],"recovers":[8],"a":[9,14],"planted":[10],"$k$":[11,50],"-partition":[12],"in":[13,53],"random":[15],"graph,":[16],"where":[17],"edges":[18,27],"within":[19],"vertex":[20,29,42],"classes":[21,30,43],"occur":[22,31],"probability":[24,33],"$p$":[25],"and":[26,66],"between":[28],"$r\\ge":[34],"p+c\\sqrt{p\\log":[35],"n/n}$":[36],".":[37],"The":[38],"can":[40],"handle":[41],"of":[44,60],"different":[45],"sizes":[46],"and,":[47],"for":[48,63],"fixed":[49],",":[51],"runs":[52],"linear":[54],"time.":[55],"also":[57],"variants":[59],"the":[61],"partitioning":[64],"matrices":[65],"hypergraphs.":[67]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}