An ensemble of high rank matrices arising from tournaments
DOI10.1016/J.LAA.2022.11.004zbMATH Open1506.15034arXiv2108.10871OpenAlexW3194328708MaRDI QIDQ2104983FDOQ2104983
Authors: Niranjan Balachandran, Srimanta Bhattacharya, Brahadeesh Sankarnarayanan
Publication date: 8 December 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.10871
Recommendations
Directed graphs (digraphs), tournaments (05C20) Random matrices (algebraic aspects) (15B52) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Literature survey on low rank approximation of matrices
- Graph colouring and the probabilistic method
- Ranks of permutative matrices
- The minimum rank of symmetric matrices described by a graph: a survey
- SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
- The Ranks of Tournament Matrices
- Approximating sparse binary matrices in the cut-norm
- Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
- Random matrices have simple spectrum
- Ranks of matrices with few distinct entries
- Fractional \(L\)-intersecting families
- The rank of sparse random matrices
Cited In (4)
This page was built for publication: An ensemble of high rank matrices arising from tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104983)