On the Probability That a Random ± 1-Matrix Is Singular

From MaRDI portal
Revision as of 03:12, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4846137

DOI10.2307/2152887zbMath0829.15018OpenAlexW4247588434MaRDI QIDQ4846137

János Komlós, Jeffry Kahn

Publication date: 24 January 1996

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2152887




Related Items (72)

The distribution of sandpile groups of random graphsOn the number of Hadamard matrices via anti-concentrationOn the smallest singular value of symmetric random matricesSingularity of discrete random matricesSingularity of sparse Bernoulli matricesAdjacency matrices of random digraphs: singularity and anti-concentrationRandom symmetric matrices are almost surely nonsingular.General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic ResultsAnticoncentration and the Exact Gap-Hamming ProblemFrom the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matricesOn the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansionsSingularity of random symmetric matrices revisitedLargest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problemThe capacity of feedforward neural networksQuantitative invertibility of random matrices: a combinatorial perspectiveDoubly random polytopesInverse Littlewood-Offord problems and the singularity of random symmetric matricesQuantitative invertibility of non-Hermitian random matricesThe quarks of attention: structure and capacity of neural attention building blocksCombinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022Exponential growth of random determinants beyond invarianceComplex random matrices have no real eigenvaluesConcentration inequalities for random tensorsA central limit theorem for the determinant of a Wigner matrixRandom matrices: law of the determinantBilinear and quadratic variants on the Littlewood-Offord problemUnnamed ItemStructure of eigenvectors of random regular digraphsCubes and orientabilityRandom matrices: probability of normalityFixed energy universality of Dyson Brownian motionComplexity measures of sign matricesOn the singularity of adjacency matrices for random regular digraphsIrreducibility of Random PolynomialsAsymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matricesInvertibility of symmetric random matricesAntichain codesThe Littlewood-Offord problem and invertibility of random matricesSmallest singular value of random matrices and geometry of random polytopesWhat is known about unit cubesGaussian fluctuations of the determinant of Wigner matricesRandom matrices: The distribution of the smallest singular valuesThe rank of random regular digraphs of constant degreeOn a condition number of general random polynomial systemsSINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDSA sharp inverse Littlewood-Offord theoremThe rank of random graphsSharp transition of the invertibility of the adjacency matrices of sparse random graphsOn the universality of the non-singularity of general Ginibre and Wigner random matricesOn the singularity of random symmetric matricesThe smallest singular value of inhomogeneous square random matricesRecent progress in combinatorial random matrix theoryOn the singularity of random matrices with independent entriesApproximate Spielman-Teng theorems for the least singular value of random combinatorial matricesThe circular law for random regular digraphsEigenvectors and controllability of non-Hermitian random matrices and directed graphsOn the permanent of random Bernoulli matricesTwo-colorable graph states with maximal Schmidt measureOn the permanent of a random symmetric matrixThe smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random roundingInvertibility of adjacency matrices for random \(d\)-regular graphsSurjectivity of near-square random matricesResilience of the rank of random matricesOn the singularity probability of discrete random matricesSome new results in random matrices over finite fieldsOn the counting problem in inverse Littlewood–Offord theoryOn the singularity probability of random Bernoulli matricesSequential metric dimension for random graphsThe rank of sparse random matricesRank deficiency of random matricesPolynomial Threshold Functions, Hyperplane Arrangements, and Random TensorsRandom integral matrices: universality of surjectivity and the cokernel







This page was built for publication: On the Probability That a Random ± 1-Matrix Is Singular