{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:49:38Z","timestamp":1763459378296,"version":"3.45.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T00:00:00Z","timestamp":1462320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CCF-1017403"],"award-info":[{"award-number":["CCF-1017403"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2016,5,4]]},"abstract":"\n Spectral partitioning is a simple, nearly linear time algorithm to find sparse cuts, and the Cheeger inequalities provide a worst-case guarantee for the quality of the approximation found by the algorithm. A\n local graph partitioning algorithm<\/jats:italic>\n finds a set of vertices with small conductance (i.e., a sparse cut) by adaptively exploring part of a large graph\n G<\/jats:italic>\n , starting from a specified vertex. For the algorithm to be local, its complexity must be bounded in terms of the size of the set that it outputs, with at most a weak dependence on the number\n n<\/jats:italic>\n of vertices in\n G<\/jats:italic>\n . Previous local partitioning algorithms find sparse cuts using random walks and personalized PageRank [Spielman and Teng 2013; Andersen et al. 2006].\n <\/jats:p>\n \n In this article, we introduce a simple randomized local partitioning algorithm that finds a sparse cut by simulating the\n volume-biased evolving set process<\/jats:italic>\n , which is a Markov chain on sets of vertices. We prove that for any \u03f5 > 0, and any set of vertices\n A<\/jats:italic>\n that has conductance at most \u03c6, for at least half of the starting vertices in\n A<\/jats:italic>\n our algorithm will output (with constant probability) a set of conductance\n O<\/jats:italic>\n (\u221a\u03c6 \/\u03f5). We prove that for a given run of the algorithm, the expected ratio between its computational complexity and the volume of the set that it outputs is vol(\n A<\/jats:italic>\n )\n \u03f5<\/jats:sup>\n \u03c6\n -1\/2<\/jats:sup>\n polylog(\n n<\/jats:italic>\n ), where vol(\n A<\/jats:italic>\n ) = \u03a3\n \n v<\/jats:italic>\n \u2208\n A<\/jats:italic>\n <\/jats:sub>\n d<\/jats:italic>\n (\n v<\/jats:italic>\n ) is the volume of the set\n A<\/jats:italic>\n . This gives an algorithm with the same guarantee (up to a constant factor) as the Cheeger's inequality that runs in time slightly superlinear in the size of the output. This is the first sublinear (in the size of the input) time algorithm with almost the same guarantee as the Cheeger's inequality. In comparison, the best previous local partitioning algorithm, by Andersen et al. [2006], has a worse approximation guarantee of\n O<\/jats:italic>\n (\u221a\u03c6 log\n n<\/jats:italic>\n ) and a larger ratio of \u03c6\n -1<\/jats:sup>\n polylog(\n n<\/jats:italic>\n ) between the complexity and output volume.\n <\/jats:p>\n \n As a by-product of our results, we prove a bicriteria approximation algorithm for the expansion profile of any graph. For 0 <\n k<\/jats:italic>\n \u2264 vol(\n V<\/jats:italic>\n )\/2, let \u03c6(\n k<\/jats:italic>\n ) : min\n \n S<\/jats:italic>\n : vol(\n S<\/jats:italic>\n ) \u2264\n k<\/jats:italic>\n <\/jats:sub>\n \u03c6(\n S<\/jats:italic>\n ). There is a polynomial time algorithm that, for any\n k<\/jats:italic>\n , \u03f5 > 0, finds a set\n S<\/jats:italic>\n of volume vol(\n S<\/jats:italic>\n ) \u2264\n O<\/jats:italic>\n (\n k<\/jats:italic>\n 1 + \u03f5<\/jats:sup>\n ) and expansion \u03c6(\n S<\/jats:italic>\n )\u2264\n O<\/jats:italic>\n (\u221a\u03c6 (\n k<\/jats:italic>\n )\/\u03f5). As a new technical tool, we show that for any set\n S<\/jats:italic>\n of vertices of a graph, a lazy\n t<\/jats:italic>\n -step random walk started from a randomly chosen vertex of\n S<\/jats:italic>\n will remain entirely inside\n S<\/jats:italic>\n with probability at least (1 - \u03c6(\n S<\/jats:italic>\n )\/2)\n \n t<\/jats:italic>\n <\/jats:sup>\n . This itself provides a new lower bound to the uniform mixing time of any finite state reversible Markov chain.\n <\/jats:p>","DOI":"10.1145\/2856030","type":"journal-article","created":{"date-parts":[[2016,5,5]],"date-time":"2016-05-05T09:23:22Z","timestamp":1462440202000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Almost Optimal Local Graph Clustering Using Evolving Sets"],"prefix":"10.1145","volume":"63","author":[{"given":"Reid","family":"Andersen","sequence":"first","affiliation":[{"name":"Microsoft Corp, Redmond, Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shayan Oveis","family":"Gharan","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Peres","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1007\/BF02579166"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1016\/0095-8956(85)90092-9"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1109\/FOCS.2006.44"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1145\/1135777.1135814"},{"doi-asserted-by":"publisher","unstructured":"Reid Andersen and Yuval Peres. 2009. Finding sparse cuts locally using evolving sets. In STOC. 235--244. 10.1145\/1536414.1536449","key":"e_1_2_1_5_1","DOI":"10.1145\/1536414.1536449"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1109\/FOCS.2010.59"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.5555\/1958016.1958019"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1109\/FOCS.2011.79"},{"key":"e_1_2_1_9_1","volume-title":"Proc. Am. Math. Soc.","volume":"16","author":"Blakley G. R.","year":"1965","unstructured":"G. R. Blakley and Prabir Roy. 1965. A h\u00f6lder type inequality for symmetric matrices with nonnegative entries. In Proc. Am. Math. Soc. Vol. 16. 1244--1245."},{"key":"e_1_2_1_10_1","volume-title":"Tsz Chiu Kwok, and Lap Chi Lau","author":"Chan Siu On","year":"2015","unstructured":"Siu On Chan, Tsz Chiu Kwok, and Lap Chi Lau. 2015. Random Walks and Evolving Sets: Faster Convergences and Limitations. (2015). http:\/\/arxiv.org\/abs\/1507.02069."},{"doi-asserted-by":"publisher","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press Cambridge MA.","key":"e_1_2_1_11_1","DOI":"10.5555\/1614191"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1214\/aop\/1176990628"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1145\/347090.347121"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1137\/0218077"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1145\/990308.990313"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1145\/324133.324140"},{"doi-asserted-by":"crossref","unstructured":"Tsz Chiu Kwok and Lap Chi Lau. 2012. Finding small sparse cuts by random walk. In APPROX-RANDOM. 615--626.","key":"e_1_2_1_17_1","DOI":"10.1007\/978-3-642-32512-0_52"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.1145\/2488608.2488611"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.1145\/1367497.1367591"},{"doi-asserted-by":"publisher","key":"e_1_2_1_20_1","DOI":"10.1080\/15427951.2009.10129177"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1145\/1772690.1772755"},{"key":"e_1_2_1_22_1","volume-title":"Wilmer","author":"Levin David A.","year":"2006","unstructured":"David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. 2006. Markov chains and mixing times. American Mathematical Society."},{"key":"e_1_2_1_23_1","volume-title":"Electron. Colloq. Comput. Complex. (ECCC) 18","author":"Li Angsheng","year":"2011","unstructured":"Angsheng Li, Yicheng Pan, and Pan Peng. 2011. Testing conductance in general graphs. Electron. Colloq. Comput. Complex. (ECCC) 18 (2011), 101."},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_1","DOI":"10.1080\/15427951.2011.566458"},{"doi-asserted-by":"publisher","key":"e_1_2_1_25_1","DOI":"10.1215\/S0012-7094-66-03360-6"},{"doi-asserted-by":"publisher","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Ravi Kannan. 1999. Faster mixing via average conductance. In STOC. ACM 282--287. 10.1145\/301250.301317","key":"e_1_2_1_26_1","DOI":"10.1145\/301250.301317"},{"key":"e_1_2_1_27_1","volume-title":"Sharp edge, vertex, and mixed cheeger inequalities for finite markov kernels. Electronic Communications in Probability {electronic only} 12","author":"Montenegro Ravi","year":"2007","unstructured":"Ravi Montenegro. 2007. Sharp edge, vertex, and mixed cheeger inequalities for finite markov kernels. Electronic Communications in Probability {electronic only} 12 (2007), 377--389."},{"doi-asserted-by":"publisher","key":"e_1_2_1_28_1","DOI":"10.5555\/1526612.1526613"},{"doi-asserted-by":"publisher","unstructured":"Ben Morris and Yuval Peres. 2003. Evolving sets and mixin. In STOC. 279--286. 10.1145\/780542.780585","key":"e_1_2_1_29_1","DOI":"10.1145\/780542.780585"},{"doi-asserted-by":"publisher","key":"e_1_2_1_30_1","DOI":"10.1080\/00029890.1959.11989387"},{"key":"e_1_2_1_31_1","volume-title":"Improved small-set expansion from higher eigenvalues. CoRR abs\/1204.4688","author":"O\u2019Donnell Ryan","year":"2012","unstructured":"Ryan O\u2019Donnell and David Witmer. 2012. Improved small-set expansion from higher eigenvalues. CoRR abs\/1204.4688 (2012)."},{"doi-asserted-by":"publisher","key":"e_1_2_1_32_1","DOI":"10.1145\/2213977.2214080"},{"doi-asserted-by":"publisher","key":"e_1_2_1_33_1","DOI":"10.5555\/2133036.2133078"},{"doi-asserted-by":"publisher","unstructured":"Shayan Oveis Gharan and Luca Trevisan. 2012. Approximating the expansion profile and almost optimal local graph clustering. In FOCS. 187--196. 10.1109\/FOCS.2012.85","key":"e_1_2_1_34_1","DOI":"10.1109\/FOCS.2012.85"},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_1","DOI":"10.1145\/1806689.1806792"},{"doi-asserted-by":"publisher","key":"e_1_2_1_36_1","DOI":"10.1145\/1806689.1806776"},{"doi-asserted-by":"publisher","unstructured":"Jonah Sherman. 2009. Breaking the multicommodity flow barrier for O(&sqrt;log n)-approximations to sparsest cut. In FOCS. 363--372. 10.1109\/FOCS.2009.66","key":"e_1_2_1_37_1","DOI":"10.1109\/FOCS.2009.66"},{"doi-asserted-by":"publisher","key":"e_1_2_1_38_1","DOI":"10.1109\/34.868688"},{"doi-asserted-by":"publisher","key":"e_1_2_1_39_1","DOI":"10.1145\/1007352.1007372"},{"doi-asserted-by":"publisher","key":"e_1_2_1_40_1","DOI":"10.1137\/080744888"},{"doi-asserted-by":"publisher","key":"e_1_2_1_41_1","DOI":"10.1109\/CVPR.2006.129"},{"volume-title":"Probability with Martingales","author":"Williams David","unstructured":"David Williams. 1991. Probability with Martingales (Cambridge Mathematical Textbooks). Cambridge University Press, Cambridge.","key":"e_1_2_1_42_1"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2856030","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2856030","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2856030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:44:14Z","timestamp":1763459054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2856030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,4]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5,4]]}},"alternative-id":["10.1145\/2856030"],"URL":"https:\/\/doi.org\/10.1145\/2856030","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"type":"print","value":"0004-5411"},{"type":"electronic","value":"1557-735X"}],"subject":[],"published":{"date-parts":[[2016,5,4]]},"assertion":[{"value":"2014-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-12-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}