An Exponential Lower Bound for the Permanent of Random Bernoulli Matrix
Yiming Chen
Abstract
Let Mn be an n× n matrix with independent uniform sign entries. We prove that there exist absolute constants C,c>0 such that, for all sufficiently large n, \[ P\!( |Per(Mn)| e-Cnn! ) 1-n-c. \] This confirms, up to the exponential scale, the lower bound suggested by Tao and Vu.
Create a lesson
Related papers
On Solutions to Graphon McKean-Vlasov SDEs of Nemytskii-type
Sebastian Grube, Guodong Pang, Michael Röckner
Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics
Seonwoo Kim, Sanha Lee, Insuk Seo
On the telegrapher's signals of sticky local times
F. Colantoni, M. D'Ovidio
p-roughness of paths and invariance of p-th variation
Rama Cont
Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
Anna Kazeykina, Zhenjie Ren, Hecheng Wang
Delocalisation and scaling limit for the disordered long-range Discrete Gaussian Chain
Christopher Chalhoub, Paul Dario, Corentin Faipeur et al.