{"id":"https://openalex.org/W2020632401","doi":"https://doi.org/10.1145/1007352.1007355","title":"Expander flows, geometric embeddings and graph partitioning","display_name":"Expander flows, geometric embeddings and graph partitioning","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2020632401","doi":"https://doi.org/10.1145/1007352.1007355","mag":"2020632401"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007355","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth 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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082369624","display_name":"Satish Rao","orcid":"https://orcid.org/0000-0002-7353-333X"},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":["UC Berkeley","UC BERKELEY"],"affiliations":[{"raw_affiliation_string":"UC Berkeley","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]},{"raw_affiliation_string":"UC BERKELEY","institution_ids":["https://openalex.org/I134446601"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071039750","display_name":"Umesh Vazirani","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]},{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Umesh Vazirani","raw_affiliation_strings":["UC Berkeley","UC BERKELEY"],"affiliations":[{"raw_affiliation_string":"UC Berkeley","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]},{"raw_affiliation_string":"UC BERKELEY","institution_ids":["https://openalex.org/I134446601"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103209777"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":35.2621,"has_fulltext":false,"cited_by_count":299,"citation_normalized_percentile":{"value":0.99903017,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"222","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.664339542388916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5374655723571777},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4974386990070343},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48013922572135925},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.47412586212158203},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4575177729129791},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4448956549167633},{"id":"https://openalex.org/keywords/concentration-of-measure","display_name":"Concentration of measure","score":0.4242458939552307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4197123050689697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3183175027370453}],"concepts":[{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.664339542388916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5374655723571777},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4974386990070343},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48013922572135925},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.47412586212158203},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4575177729129791},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4448956549167633},{"id":"https://openalex.org/C84498859","wikidata":"https://www.wikidata.org/wiki/Q5158327","display_name":"Concentration of measure","level":2,"score":0.4242458939552307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4197123050689697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3183175027370453},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/1007352.1007355","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.2242","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~arora/pubs/arvfull.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.182.2689","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.2689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cc.gatech.edu/%7Emihail/D.7520reading/7520sparsestcut.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.2881","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.2881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~arora/pubs/arvfull.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.310.2258","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.2258","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~vazirani/pubs/arvjacm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.2284","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.2284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~arora/pubs/arvstoc.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.8415","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.8415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~arora/pubs/arvstoc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W35869410","https://openalex.org/W100944330","https://openalex.org/W1519655831","https://openalex.org/W1553598118","https://openalex.org/W1571037334","https://openalex.org/W1573558634","https://openalex.org/W1578099820","https://openalex.org/W1588155622","https://openalex.org/W1631603072","https://openalex.org/W1632601927","https://openalex.org/W1963753244","https://openalex.org/W1968864043","https://openalex.org/W1974785036","https://openalex.org/W1976418263","https://openalex.org/W1978020111","https://openalex.org/W1985123706","https://openalex.org/W1985215886","https://openalex.org/W1993111701","https://openalex.org/W2002617302","https://openalex.org/W2002643080","https://openalex.org/W2018025029","https://openalex.org/W2022596683","https://openalex.org/W2033281046","https://openalex.org/W2035652501","https://openalex.org/W2044343300","https://openalex.org/W2049143039","https://openalex.org/W2049609719","https://openalex.org/W2063491776","https://openalex.org/W2069816168","https://openalex.org/W2078289947","https://openalex.org/W2085427851","https://openalex.org/W2100440346","https://openalex.org/W2106264302","https://openalex.org/W2106285343","https://openalex.org/W2107881198","https://openalex.org/W2122205547","https://openalex.org/W2127114399","https://openalex.org/W2129027842","https://openalex.org/W2134422938","https://openalex.org/W2137373403","https://openalex.org/W2150148016","https://openalex.org/W2165956524","https://openalex.org/W2167816765","https://openalex.org/W2176446742","https://openalex.org/W2611804663","https://openalex.org/W2626503362","https://openalex.org/W2792481128","https://openalex.org/W3098011928","https://openalex.org/W4235946010","https://openalex.org/W4293860921","https://openalex.org/W4300550233","https://openalex.org/W6634702315","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W2025698306","https://openalex.org/W1481223916","https://openalex.org/W2149302127","https://openalex.org/W2035448415","https://openalex.org/W1850573590","https://openalex.org/W2561136735","https://openalex.org/W1482102823","https://openalex.org/W3136945252","https://openalex.org/W1950827710","https://openalex.org/W2105630880"],"abstract_inverted_index":{"We":[0,25,61,85],"give":[1],"a":[2,27,40,56,70],"O(\u221alog":[3],"n)-approximation":[4,19],"algorithm":[5],"for":[6,69],"sparsest":[7],"cut,":[8],"balanced":[9],"separator,":[10],"and":[11,22,66,83],"graph":[12],"conductance":[13],"problems.":[14],"This":[15],"improves":[16],"the":[17],"O(log":[18],"of":[20,45,55],"Leighton":[21],"Rao":[23],"(1988).":[24],"use":[26,54],"well-known":[28],"semidefinite":[29],"relaxation":[30],"with":[31,80],"triangle":[32],"inequality":[33],"constraints.":[34],"Central":[35],"to":[36],"our":[37],"analysis":[38],"is":[39],"geometric":[41],"theorem":[42],"about":[43],"projections":[44],"point":[46],"sets":[47],"in":[48,78],"Rd,":[49],"whose":[50],"proof":[51],"makes":[52],"essential":[53],"phenomenon":[57],"called":[58],"measure":[59],"concentration.":[60],"also":[62],"describe":[63],"an":[64,75,88],"interesting":[65],"natural":[67],"\"certificate\"":[68],"graph's":[71],"expansion,":[72],"by":[73],"embedding":[74],"n-node":[76],"expander":[77,89],"it":[79],"appropriate":[81],"dilation":[82],"congestion.":[84],"call":[86],"this":[87],"flow.":[90]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":22}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}