Permanents of matrix ensembles: computation, distribution, and geometry
Igor Rivin

TL;DR
This paper investigates the computational aspects, statistical distributions, and geometric properties of matrix permanents across various ensembles, revealing new distributional behaviors and universal scaling laws through GPU-accelerated experiments.
Contribution
It provides the first comprehensive computational and experimental analysis of permanents for diverse matrix ensembles, uncovering their distributional characteristics and geometric behavior.
Findings
Haar unitary matrix permanents follow a complex Gaussian distribution.
Haar orthogonal matrix permanents are approximately real Gaussian with positive kurtosis.
Gaussian ensemble permanents follow an alpha-stable distribution with index ~1.0-1.4.
Abstract
We report on a computational and experimental study of permanents. On the computational side, we use the GPU to greaatly accelerate the computation of permanents over and First, for Haar-distributed unitary matrices~, the permanent follows a circularly-symmetric complex Gaussian distribution -- we confirm this via a number of tests for up to~23 with samples. The DFT matrix permanent is an extreme outlier for every prime . In contrast, for Haar-random \emph{orthogonal} matrices~, the permanent is approximately real Gaussian but with positive excess kurtosis that decays as~, indicating slower convergence. For matrices with Gaussian entries (GUE, GOE, Ginibre), the permanent follows an -stable distribution with stability index $\alpha\approx…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Markov Chains and Monte Carlo Methods · Advanced Combinatorial Mathematics
