{"id":"https://openalex.org/W6948359106","doi":"https://doi.org/10.5075/epfl-thesis-8132","title":"Sublinear Algorithms for Spectral Graph Clustering","display_name":"Sublinear Algorithms for Spectral Graph Clustering","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W6948359106","doi":"https://doi.org/10.5075/epfl-thesis-8132"},"language":"en","primary_location":{"id":"pmh:doi:10.5075/epfl-thesis-8132","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/183784","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mousavifar, Aidasadat","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mousavifar, Aidasadat","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5200999975204468,"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.5200999975204468,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.08169999718666077,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.06310000270605087,"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/graph","display_name":"Graph","score":0.32420000433921814},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.2809000015258789},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.2583000063896179},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.2531000077724457},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.24709999561309814}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32589998841285706},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3012999892234802},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.2583000063896179},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.24709999561309814},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.24150000512599945},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23899999260902405},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.22830000519752502}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.5075/epfl-thesis-8132","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},{"id":"pmh:oai:infoscience.epfl.ch:290667","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/183784","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},{"id":"doi:10.5075/epfl-thesis-8132","is_oa":true,"landing_page_url":"https://doi.org/10.5075/epfl-thesis-8132","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:290667","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/183784","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,126],"thesis":[1],"focuses":[2],"on":[3,141,199,221,265,405],"designing":[4],"spectral":[5,196,313,344,377,382,397,415],"tools":[6],"for":[7,41,57,81,101,160,236,323],"graph":[8,74,83,110,136,187,238,270,275,401],"clustering":[9,84,254,271,314,383],"in":[10,62,182,256,309,395,413],"sublinear":[11,79,310,334],"time.":[12,311],"With":[13],"the":[14,54,109,146,158,166,169,183,186,201,204,222,231,247,257,273,304,343,347,362,376,396,400,414],"emergence":[15],"of":[16,39,53,66,130,134,163,173,185,203,207,225,269,300,346,361,365,399,409],"big":[17],"data,":[18],"many":[19],"traditional":[20],"polynomial":[21],"time,":[22],"and":[23,73,175],"even":[24],"linear":[25,359],"time":[26,335],"algorithms":[27,40],"have":[28],"become":[29],"prohibitively":[30],"expensive.":[31],"Processing":[32],"modern":[33],"datasets":[34],"requires":[35],"a":[36,63,128,131,217,266,290,333,381,386,406],"new":[37],"set":[38],"computing":[42],"with":[43,216,282,353],"extremely":[44],"constrained":[45],"resources,":[46],"i.e.,":[47,105],"\\emph{sublinear":[48],"algorithms}.":[49],"Clustering":[50],"is":[51,120,127,178,332],"one":[52],"well-known":[55],"techniques":[56,197],"solving":[58],"large-scale":[59],"optimization":[60],"problems":[61,85],"wide":[64],"variety":[65],"domains,":[67],"including":[68],"machine":[69],"learning,":[70],"data":[71,293],"science":[72],"analysis~\\cite{aydin2016distributed,":[75],"rolnick2016geocuts,":[76],"gargi2011large}.":[77],"Efficient":[78],"solutions":[80],"fundamental":[82],"require":[86],"going":[87],"well":[88],"beyond":[89],"classic":[90,139],"techniques.":[91],"In":[92],"this":[93],"thesis,":[94],"we":[95,241,379],"present":[96],"an":[97,252,357],"\\emph{optimal}":[98],"sublinear-time":[99],"algorithm":[100,215,255],"\\textit{testing":[102],"$k$-clusterability":[103,143],"problem},":[104],"quickly":[106,297],"determining":[107],"whether":[108],"can":[111,276],"be":[112,277],"partitioned":[113,278],"into":[114,279],"at":[115,179],"most":[116],"$k$":[117,164,280],"expanders,":[118],"or":[119,156],"far":[121],"from":[122,246],"any":[123,324],"such":[124],"graph.":[125,348],"generalization":[129],"well-studied":[132],"problem":[133,149,159],"testing":[135,142,147,226,237],"expansion.":[137,239],"The":[138],"results":[140],"either":[144],"consider":[145],"expansion":[148],"(i.e,":[150],"$k=1$":[151],"vs":[152],"$k\\geq":[153],"2$)":[154],"\\cite{KaleS_SIAMJC11,NachmiasS10},":[155],"address":[157],"larger":[161],"values":[162],"under":[165],"assumption":[167],"that":[168,295,337],"gap":[170],"between":[171],"conductances":[172],"accepted":[174],"rejected":[176],"graphs":[177],"least":[180],"logarithmic":[181],"size":[184],"\\cite{CzumajPS_STOC15}.":[188],"We":[189,212,263,288,349],"overcome":[190],"these":[191],"barriers":[192],"by":[193,286],"developing":[194],"novel":[195],"based":[198],"analyzing":[200],"spectrum":[202],"Gram":[205,363],"matrix":[206,364],"random":[208,366],"walk":[209,367],"transition":[210,368],"probabilities.":[211,369],"complement":[213],"our":[214,243,389],"matching":[218],"lower":[219,234],"bound":[220,235],"query":[223],"complexity":[224],"$k$-clusterability,":[227],"which":[228],"improves":[229],"upon":[230],"long-standing":[232],"previous":[233,244],"Furthermore,":[240],"extend":[242],"result":[245],"\\textit{property":[248],"testing}":[249],"framework":[250],"to":[251,303,308,342,375,392,417],"efficient":[253],"\\textit{local":[258],"computation":[259],"algorithm}":[260],"(LCA)":[261],"model.":[262],"focus":[264],"popular":[267],"variant":[268],"where":[272],"input":[274],"expanders":[281],"outer":[283],"conductance":[284],"bounded":[285],"$\\epsilon$.":[287],"construct":[289],"small":[291],"space":[292],"structure":[294],"allows":[296],"classifying":[298],"vertices":[299],"$G$":[301],"according":[302],"cluster":[305,322,420],"they":[306],"belong":[307],"Our":[312,329],"oracle":[315,336],"provides":[316,338],"$O(\\epsilon":[317],"\\log":[318],"k)$":[319],"error":[320],"per":[321,419],"$\\epsilon":[325],"\\ll":[326],"1/\\log":[327],"k$.":[328],"main":[330],"contribution":[331],"dot":[339,351,372],"product":[340,373],"access":[341,374],"embedding":[345,378,398,416],"estimate":[350],"products":[352],"high":[354,387],"precision":[355],"using":[356,371],"appropriate":[358],"transformation":[360],"Finally,":[370],"design":[380],"oracle.":[384],"At":[385],"level,":[388],"approach":[390],"amounts":[391],"hyperplane":[393],"partitioning":[394],"but":[402],"crucially":[403],"operates":[404],"nested":[407],"sequence":[408],"carefully":[410],"defined":[411],"subspaces":[412],"achieve":[418],"recovery":[421],"guarantees.":[422]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}