The asymptotic probability that a random biased matrix is invertible
The authors present the following: Let \(q=p^ e\) be a power of a prime. Suppose that there is a probability distribution on GF(q) not concentrated on any proper affine subspace of GF(q) regarded as a vector space over its prime subfield GF(p). Let M be a random n by n matrix whose entries are chosen independently from the given distribution and let \(A_ n\) be the probability that M is invertible. Then it is shown that \(\lim_{n\to \infty}A_ n=\prod^{\infty}_{i=1}(1-1/q^ i).\) The independence of the entries of the matrix plays a role but can obviously be replaced by other conditions on more general distributions.
- scientific article; zbMATH DE number 1545673
- scientific article; zbMATH DE number 1436005
- Limit probabilities for coranks of matrices over GF(q)
- Singularity probabilities for random matrices over finite fields
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- Enumeration of subspaces by dimension sequence
- The permanent rank of a matrix
- Stein's method and the rank distribution of random matrices over finite fields
- The Littlewood-Offord problem and invertibility of random matrices
- Systems of random equations over finite algebraic structures
- Random matrix theory over finite fields
- Multi-verifier signatures
- Some new results in random matrices over finite fields
- The distribution of sandpile groups of random graphs
- Invertibility of symmetric random matrices
- Probability theory for random groups arising in number theory
- On the probability of completeness for large markets
- Universality for cokernels of Dedekind domain valued random matrices
This page was built for publication: The asymptotic probability that a random biased matrix is invertible
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640667)