{"id":"https://openalex.org/W7149012987","doi":"https://doi.org/10.48550/arxiv.2604.01367","title":"Approximating the Permanent of a Random Matrix with Polynomially Small Mean: Zeros and Universality","display_name":"Approximating the Permanent of a Random Matrix with Polynomially Small Mean: Zeros and Universality","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7149012987","doi":"https://doi.org/10.48550/arxiv.2604.01367"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01367","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01367","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2604.01367","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003106042","display_name":"Frederic Koehler","orcid":"https://orcid.org/0000-0001-5220-9680"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koehler, Frederic","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132863232","display_name":"Pui Kuen Leung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leung, Pui Kuen","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/T11716","display_name":"Random Matrices and Applications","score":0.4819999933242798,"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"}},"topics":[{"id":"https://openalex.org/T11716","display_name":"Random Matrices and Applications","score":0.4819999933242798,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.2361000031232834,"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.11110000312328339,"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/universality","display_name":"Universality (dynamical systems)","score":0.6676999926567078},{"id":"https://openalex.org/keywords/random-matrix","display_name":"Random matrix","score":0.621999979019165},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4697999954223633},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.43650001287460327},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42739999294281006},{"id":"https://openalex.org/keywords/interpolation","display_name":"Interpolation (computer graphics)","score":0.40880000591278076},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4058000147342682},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3799999952316284}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7731999754905701},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.6676999926567078},{"id":"https://openalex.org/C64812099","wikidata":"https://www.wikidata.org/wiki/Q176604","display_name":"Random matrix","level":3,"score":0.621999979019165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4772999882698059},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.474700003862381},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4697999954223633},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.43650001287460327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42739999294281006},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.40880000591278076},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4058000147342682},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C52386014","wikidata":"https://www.wikidata.org/wiki/Q166211","display_name":"Random element","level":3,"score":0.36390000581741333},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C52627884","wikidata":"https://www.wikidata.org/wiki/Q4424101","display_name":"Random compact set","level":4,"score":0.35510000586509705},{"id":"https://openalex.org/C88080468","wikidata":"https://www.wikidata.org/wiki/Q637347","display_name":"Polynomial interpolation","level":4,"score":0.34439998865127563},{"id":"https://openalex.org/C13929819","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Random function","level":3,"score":0.3160000145435333},{"id":"https://openalex.org/C130402806","wikidata":"https://www.wikidata.org/wiki/Q5361768","display_name":"Random field","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2937000095844269},{"id":"https://openalex.org/C6077466","wikidata":"https://www.wikidata.org/wiki/Q5156597","display_name":"Complex quadratic polynomial","level":3,"score":0.27079999446868896},{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.2651999890804291},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.2506999969482422},{"id":"https://openalex.org/C126352355","wikidata":"https://www.wikidata.org/wiki/Q2562273","display_name":"Polynomial matrix","level":4,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01367","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01367","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2604.01367","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01367","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,86,188],"study":[1],"algorithms":[2,132],"for":[3,64,194,214],"approximating":[4,185],"the":[5,12,25,29,53,65,73,90,101,120,123,159,162,180,186,195],"permanent":[6],"of":[7,27,32,52,92,100,111,122,161,168,184],"a":[8,59,79,109,153],"random":[9,80,102,215],"matrix":[10,75,81],"when":[11,89,119],"entries":[13,91,124],"are":[14,94],"slightly":[15],"biased":[16],"away":[17],"from":[18,178],"zero.":[19],"This":[20,173],"question":[21],"is":[22,72,78,125],"motivated":[23],"by":[24],"goal":[26],"understanding":[28],"classical":[30],"complexity":[31],"linear":[33],"optics":[34],"and":[35,39,43,76,138],"\\emph{boson":[36],"sampling}":[37],"(Aaronson":[38],"Arkhipov":[40],"'11;":[41],"Eldar":[42],"Mehraban":[44],"'17).":[45],"Barvinok's":[46],"interpolation":[47,176],"method":[48,177],"enables":[49],"efficient":[50,131],"approximation":[51,117],"permanent,":[54],"provided":[55],"one":[56],"can":[57],"establish":[58,190],"sufficiently":[60],"large":[61],"zero-free":[62,192,212],"region":[63],"polynomial":[66,103],"$\\mathrm{per}(zJ":[67,104],"+":[68,105],"W)$,":[69],"where":[70],"$J$":[71],"all-ones":[74],"$W$":[77,93,217],"with":[82,148,201,218],"independent":[83],"mean-zero":[84],"entries.":[85,221],"show":[87,157],"that":[88,158],"standard":[95],"complex":[96,202],"Gaussians,":[97],"all":[98],"zeros":[99,146],"W)$":[106],"lie":[107],"within":[108],"disk":[110],"radius":[112],"$\\tilde{O}(n^{-1/3})$,":[113],"which":[114],"yields":[115],"an":[116],"algorithm":[118],"bias":[121],"$\\tilde\u03a9(n^{-1/3})$.":[126],"Previously,":[127],"there":[128,143],"were":[129],"no":[130],"at":[133],"biases":[134],"smaller":[135],"than":[136],"$1/\\mathrm{polylog}(n)$,":[137],"it":[139],"was":[140],"unknown":[141],"whether":[142],"typically":[144],"exist":[145],"$z$":[147],"$|z|":[149],"\\ge":[150],"1$.":[151],"As":[152],"complementary":[154],"result,":[155],"we":[156,207],"bulk":[160],"zeros,":[163],"namely":[164],"$(1":[165],"-":[166],"\u03b5)n$":[167],"them,":[169],"have":[170],"magnitude":[171],"$\u0398(n^{-1/2})$.":[172],"prevents":[174],"our":[175],"contradicting":[179],"conjectured":[181],"average-case":[182],"hardness":[183],"permanent.":[187],"also":[189],"analogous":[191],"regions":[193,213],"hardcore":[196],"model":[197],"on":[198],"general":[199],"graphs":[200],"vertex":[203],"fugacities.":[204],"In":[205],"addition,":[206],"prove":[208],"universality":[209],"results":[210],"establishing":[211],"matrices":[216],"i.i.d.":[219],"subexponential":[220]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-04T00:00:00"}