Random symmetric matrices are almost surely nonsingular. (Q854582): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On a lemma of Littlewood and Offord / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates for the concentration function of combinatorial number theory and probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Probability That a Random ± 1-Matrix Is Singular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5633357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5839995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invertibility of random matrices: norm of the inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random ±1 matrices: Singularity and determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Littlewood-Offord theorems and the condition number of random discrete matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the singularity probability of random Bernoulli matrices / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050767937 / rank
 
Normal rank

Latest revision as of 09:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Random symmetric matrices are almost surely nonsingular.
scientific article

    Statements

    Random symmetric matrices are almost surely nonsingular. (English)
    0 references
    0 references
    0 references
    0 references
    5 December 2006
    0 references
    The authors consider random symmetric \(n \times n\) matrices \(Q_n\) whose upper-diagonal entries are independent, identically distributed, and take values \(0\) and \(1\) with probabilities \(1/2\). Asymptotical relations are obtained presenting upper estimates of the probability \(p_n\) that \(Q_n\) is non-singular. Theorem 1 states that for any \(\delta > 0\) for sufficiently large \(n\) the probability \(p_n \leq {an}^{-1/8 +\delta},\) where \(a = a (\delta)\) does not depend on \(n\). This assertion is generalized as follows. A random variable \(\xi\) is said to have \(\rho\)-property if \[ \max_ {c \in \mathbb R}{\mathbf P}(\xi = c ) \leq \rho. \] Theorem 2 states the following. Let some \(\rho > 0\) exist such that in the sequence of matrices \(Q_n = \{\xi_{ij}\}\) all entries \(\xi_{ij}\) have \(\rho\)-property. Then for any \(\delta > 0\) for sufficiently large \(n\), we have \(p_{n} \leq bn^{-1/8 + \delta},\) where \(b = b (\rho, \delta)\) is independent of \(n\). One more theorem presents a quadratic generalization of the Littlewood-Offord inequality. Let \(z_1,z_2, \dots, z_n\) be independent identically distributed random variables that are equal to \(0\) or \(1\) with the probabilities \(1/2\). Consider quadratic forms \[ Q = \sum^{n}_{i,j=1} c_{ij}z_i z_j, \] in which sufficiently many coeficients are larger \(1\) in absolute value. The authors obtain an asymptotical upper estimate for the probability \({\mathbf P}(Q \in I)\) as \(n \rightarrow \infty\), where \(I\) is an arbitrary non-random interval of length \(1\).
    0 references
    non-singular
    0 references
    Littlewood-Offord inequality
    0 references
    quadratic forms
    0 references

    Identifiers