{"id":"https://openalex.org/W7167894024","doi":"https://doi.org/10.48550/arxiv.2607.08556","title":"Locally Approximating the Top Eigenvector of Bounded Entry Matrices","display_name":"Locally Approximating the Top Eigenvector of Bounded Entry Matrices","publication_year":2026,"publication_date":"2026-07-09","ids":{"openalex":"https://openalex.org/W7167894024","doi":"https://doi.org/10.48550/arxiv.2607.08556"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.08556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.08556","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.08556","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114653997","display_name":"Nicolas Menand","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Menand, Nicolas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140400274","display_name":"Erik Waingarten","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Waingarten, Erik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7085999846458435,"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.7085999846458435,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.11860000342130661,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.03880000114440918,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.7271999716758728},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6794999837875366},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6100999712944031},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5734000205993652},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5374000072479248},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4909000098705292},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4426000118255615},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.43220001459121704}],"concepts":[{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.7271999716758728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7038000226020813},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6794999837875366},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6100999712944031},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5734000205993652},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5374000072479248},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4426000118255615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44040000438690186},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.43220001459121704},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4163999855518341},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41019999980926514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40230000019073486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3977000117301941},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.3066999912261963},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.25099998712539673},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.08556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.08556","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.08556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.08556","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"We":[0],"provide":[1,136],"a":[2,15,59,100],"local":[3,55,137,169],"computation":[4,56,138],"algorithm":[5,57,134,176],"to":[6,42,47,87,112,135,179,188],"approximate":[7,43,164],"the":[8,31,44,106,120,141,147,159],"top":[9,116,160],"eigenvector":[10,117],"$x":[11],"\\in":[12,19],"\\mathbb{R}^n$":[13],"of":[14,33,62,68,103,109,124,151,171],"symmetric":[16],"matrix":[17],"$A":[18],"\\mathbb{R}^{n":[20],"\\times":[21],"n}$":[22],"with":[23],"entries":[24],"between":[25],"$-1$":[26],"and":[27,35,64,93,143,174],"$1$,":[28],"building":[29],"on":[30,105],"work":[32],"Swartworth":[34],"Woodruff":[36],"[SODA":[37],"25]":[38],"who":[39],"show":[40,99],"how":[41],"eigenvalues":[45],"up":[46],"additive-$\\varepsilon":[48,72],"n$":[49,73],"error":[50],"using":[51],"$\\tilde{O}(1/\\varepsilon^4)$":[52,63],"queries.":[53],"Our":[54],"has":[58],"preprocessing":[60,92],"complexity":[61,67,85,123],"per-coordinate":[65,121],"query":[66,122],"$\\tilde{O}(1/\\varepsilon^2)$":[69],"for":[70,140],"an":[71,114,129,163],"approximation":[74],"whenever":[75],"{$|\u03bb_{\\min}(A)|":[76],"=":[77],"O(\u03bb_{\\max}(A))$.":[78],"When":[79],"$\u03bb_{\\min}(A)$":[80],"greatly":[81],"exceeds":[82],"$\u03bb_{\\max}(A)$,":[83],"our":[84,133],"degrades":[86],"at":[88],"most":[89],"$\\tilde{O}(1/\\varepsilon^{6.\\overline{6}})$":[90],"in":[91,146,183,194],"$\\tilde{O}(1/\\varepsilon^{3.\\overline{3}})$":[94],"per":[95],"query.":[96],"Furthermore,":[97],"we":[98,131,167],"lower":[101],"bound":[102],"$\u03a9(n/\\varepsilon^2)$":[104],"total":[107],"number":[108],"queries":[110],"needed":[111],"output":[113],"approximately":[115],"(implying":[118],"that":[119],"$\u03a9(1/\\varepsilon^2)$":[125],"is":[126,192],"necessary).":[127],"As":[128],"application,":[130],"use":[132],"algorithms":[139],"sparsest-cut":[142],"max-cut":[144],"problems":[145],"dense":[148],"graph":[149],"model":[150],"Goldreich,":[152,195],"Goldwasser,":[153,196],"Ron":[154],"[JACM":[155],"98].":[156],"By":[157],"accessing":[158],"eigenvectors":[161],"(of":[162],"normalized":[165],"adjacency),":[166],"implement":[168],"versions":[170],"Cheeger's":[172],"inequality":[173],"Trevisan's":[175],"[SICOMP":[177],"12]":[178],"obtain":[180],"\"square-root-opt\"":[181],"approximations":[182],"polynomial":[184],"time":[185,190],"(as":[186],"opposed":[187],"exponential-in-$\\text{poly}(1/\\varepsilon)$":[189],"which":[191],"incurred":[193],"Ron.":[197]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-11T00:00:00"}