{"id":"https://openalex.org/W2140432232","doi":"https://doi.org/10.1145/1536414.1536449","title":"Finding sparse cuts locally using evolving sets","display_name":"Finding sparse cuts locally using evolving sets","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2140432232","doi":"https://doi.org/10.1145/1536414.1536449","mag":"2140432232"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536449","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007626895","display_name":"Reid Andersen","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Reid Andersen","raw_affiliation_strings":["Microsoft Live Labs, Redmond, WA, USA","Microsoft Live Labs, Redmond, WA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Live Labs, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Live Labs, Redmond, WA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020836845","display_name":"Yuval Peres","orcid":"https://orcid.org/0000-0001-5456-6323"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuval Peres","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.76,"has_fulltext":false,"cited_by_count":137,"citation_normalized_percentile":{"value":0.99215423,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9937999844551086,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9914000034332275,"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/computer-science","display_name":"Computer science","score":0.5782802700996399},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4000510573387146}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5782802700996399},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4000510573387146}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1536414.1536449","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.247.4087","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.247.4087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0811.3779v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1600293573","https://openalex.org/W1602844557","https://openalex.org/W1916091028","https://openalex.org/W1974785036","https://openalex.org/W1984374364","https://openalex.org/W1991556567","https://openalex.org/W1995547833","https://openalex.org/W2010037144","https://openalex.org/W2020632401","https://openalex.org/W2045107949","https://openalex.org/W2051540665","https://openalex.org/W2067976091","https://openalex.org/W2078013954","https://openalex.org/W2084309732","https://openalex.org/W2086254934","https://openalex.org/W2099463627","https://openalex.org/W2110861125","https://openalex.org/W2131717044","https://openalex.org/W2135512436","https://openalex.org/W2135531856","https://openalex.org/W2140802988","https://openalex.org/W2145701440","https://openalex.org/W2157071288","https://openalex.org/W2572321817","https://openalex.org/W2950755820","https://openalex.org/W2952395520","https://openalex.org/W3145128584","https://openalex.org/W4230058301","https://openalex.org/W4230962939","https://openalex.org/W4243187700","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"A":[0,119,135],"local":[1,68,87,189,219],"graph":[2,24],"partitioning":[3,69,88,190,220],"algorithm":[4,33,89,137,221,229,242],"finds":[5,91],"a":[6,14,22,28,56,85,92,104,145,158,204,223,227,235,253],"set":[7,49,100,116,146,176,275],"of":[8,21,44,47,63,109,117,130,147,161,174,207,238,273],"vertices":[9,64,118,133],"with":[10,53,255,276],"small":[11],"conductance":[12,122,148,256,277],"(i.e.":[13],"sparse":[15,72,93],"cut)":[16],"by":[17,95],"adaptively":[18],"exploring":[19],"part":[20],"large":[23],"G,":[25],"starting":[26,132],"from":[27],"specified":[29],"vertex.":[30],"For":[31],"the":[32,45,48,60,97,131,162,164,172,175,186,199,212,240,270],"to":[34,193],"be":[35,40],"local,":[36],"its":[37,168],"complexity":[38,170,213,244],"must":[39],"bounded":[41],"in":[42,65,134],"terms":[43],"size":[46],"that":[50,90,113,120,156,177],"it":[51,178],"outputs,":[52],"at":[54,123,127,142,264,278],"most":[55,124,279],"weak":[57],"dependence":[58],"on":[59,107],"number":[61],"n":[62],"G.":[66],"Previous":[67],"algorithms":[70],"find":[71],"cuts":[73],"using":[74],"random":[75],"walks":[76],"and":[77,171,196,214,251,262],"personalized":[78],"PageRank.":[79],"In":[80,184],"this":[81],"paper,":[82],"we":[83,225],"introduce":[84],"randomized":[86],"cut":[94,254],"simulating":[96],"volume-biased":[98],"evolving":[99],"process,":[101],"which":[102],"is":[103,180,269],"Markov":[105],"chain":[106],"sets":[108],"vertices.":[110],"We":[111,154],"prove":[112,155],"for":[114,126,157,230],"any":[115,274],"has":[121,198,243],"\u03c6,":[125,239],"least":[128,143,265],"half":[129],"our":[136,218],"will":[138],"output":[139,215],"(with":[140],"probability":[141],"half),":[144],"O(\u03c6":[149,181,208,257],"1/2":[150,152,258,260],"log":[151,259],"n).":[153],"given":[159],"run":[160],"algorithm,":[163,191],"expected":[165],"ratio":[166,206],"between":[167,211],"computational":[169],"volume":[173,263,272],"outputs":[179],"\u22121/2":[182],"polylog(n)).":[183],"comparison,":[185],"best":[187],"previous":[188],"due":[192],"Andersen,":[194],"Chung,":[195],"Lang,":[197],"same":[200],"approximation":[201],"guarantee,":[202],"but":[203],"larger":[205],"\u22121":[209],"polylog(n))":[210],"volume.":[216],"Using":[217],"as":[222],"subroutine,":[224],"construct":[226],"fast":[228],"finding":[231],"balanced":[232],"cuts.":[233],"Given":[234],"fixed":[236],"value":[237],"resulting":[241],"(m":[245],"+":[246],"n\u03c6":[247],"\u22121/2))":[248],"\u00b7":[249],"O(polylog(n))":[250],"returns":[252],"n)":[261],"v\u03c6/2,":[266],"where":[267],"v\u03c6":[268],"largest":[271],"\u03c6.":[280],"1":[281,282]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":18}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}