The rank of random regular digraphs of constant degree
Authors:
- Alexander E. LitvakALAlexander E. Litvak
- Anna LytovaALAnna Lytova
- Konstantin TikhomirovKTKonstantin Tikhomirov
- Nicole Tomczak-JaegermannNTNicole Tomczak-Jaegermann
- Pierre YoussefPYPierre Youssef
- 1 October 2018
- journal article
- research article
- Published by Elsevier in Journal of Complexity
- Vol. 48, 103-110
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- ANR (16-CE40-0024-01)
- National Science Foundation (DMS-1440140)
This publication has 13 references indexed in Scilit:
- Invertibility of sparse non-Hermitian matricesAdvances in Mathematics, 2017
- Adjacency matrices of random digraphs: Singularity and anti-concentrationJournal of Mathematical Analysis and Applications, 2017
- Anti-concentration property for random digraphs and invertibility of their adjacency matricesComptes Rendus Mathematique, 2016
- On the singularity of adjacency matrices for random regular digraphsProbability Theory and Related Fields, 2015
- Inverse Littlewood–Offord problems and the singularity of random symmetric matricesDuke Mathematical Journal, 2012
- Around the circular lawProbability Surveys, 2012
- The rank of diluted random graphsThe Annals of Probability, 2011
- On the singularity probability of discrete random matricesJournal of Functional Analysis, 2010
- The rank of random graphsRandom Structures & Algorithms, 2008
- Random symmetric matrices are almost surely nonsingularDuke Mathematical Journal, 2006