Skip to main content

On the singularity of adjacency matrices for random regular digraphs

Abstract

We prove that the (non-symmetric) adjacency matrix of a uniform random d-regular directed graph on n vertices is asymptotically almost surely invertible, assuming \(\min (d,n-d)\ge C\log ^2n\) for a sufficiently large constant \(C>0\). The proof makes use of a coupling of random regular digraphs formed by “shuffling” the neighborhood of a pair of vertices, as well as concentration results for the distribution of edges, proved in Cook (Random Struct Algorithms. arXiv:1410.5595, 2014). We also apply our general approach to prove asymptotically almost surely invertibility of Hadamard products \(\varSigma {{\mathrm{\circ }}}\varXi \), where \(\varXi \) is a matrix of iid uniform \(\pm 1\) signs, and \(\varSigma \) is a 0/1 matrix whose associated digraph satisfies certain “expansion” properties.

This is a preview of subscription content, access via your institution.

Fig. 1

References

  1. Adamczak, R., Chafaï, D.: Circular law for random matrices with unconditional log-concave distribution. Commun. Contemp. Math. 17(4), 1550020 (2015). doi:10.1142/S0219199715500200

    Article  MathSciNet  MATH  Google Scholar 

  2. Adamczak, R., Chafaï, D., Wolff, P.: Circular law for random matrices with exchangeable entries. arXiv:1402.3660

  3. Basak, A., Dembo, A.: Limiting spectral distribution of sums of unitary and orthogonal matrices. Electron. Commun. Probab. 18(69), 19 (2013). doi:10.1214/ECP.v18-2466

    MathSciNet  MATH  Google Scholar 

  4. Bordenave, C., Caputo, P., Chafaï, D.: Circular law theorem for random Markov matrices. Probab. Theory Relat. Fields 152(3–4), 751–779 (2012). doi:10.1007/s00440-010-0336-1

    Article  MathSciNet  MATH  Google Scholar 

  5. Bordenave, C., Chafaï, D.: Around the circular law. Probab. Surv. 9, 1–89 (2012). doi:10.1214/11-PS183

    Article  MathSciNet  MATH  Google Scholar 

  6. Bourgain, J., Vu, V.H., Wood, P.M.: On the singularity probability of discrete random matrices. J. Funct. Anal. 258(2), 559–603 (2010). doi:10.1016/j.jfa.2009.04.016

    Article  MathSciNet  MATH  Google Scholar 

  7. Canfield, E.R., McKay, B.D.: Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums. Electron. J. Comb. 12, 31. http://www.combinatorics.org/Volume_12/Abstracts/v12i1r29.html (2005). Accessed 16 Nov 2015 (Research Paper 29)

  8. Canfield, E.R., McKay, B.D.: Asymptotic enumeration of integer matrices with large equal row and column sums. Combinatorica 30(6), 655–680 (2010). doi:10.1007/s00493-010-2426-1

    Article  MathSciNet  MATH  Google Scholar 

  9. Chatterjee, S.: Stein’s method for concentration inequalities. Probab. Theory Relat. Fields 138(1–2), 305–321 (2007). doi:10.1007/s00440-006-0029-y

    Article  MathSciNet  MATH  Google Scholar 

  10. Chatterjee, S., Diaconis, P., Sly, A.: On properties of random doubly stochastic matrices. To appear in Ann. de l’Inst. Henri Poincaré

  11. Cook, N.A.: Discrepancy properties for random regular digraphs. Random Struct. Algorithms (2014, to appear). arXiv:1410.5595

  12. Dumitriu, I., Johnson, T.: The Marcenko-Pastur law for sparse random bipartite biregular graphs. arXiv:1304.4907 [math]

  13. Dumitriu, I., Pal, S.: Sparse regular random graphs: spectral density and eigenvectors. Ann. Probab. 40(5), 2197–2235 (2012). doi:10.1214/11-AOP673

    Article  MathSciNet  MATH  Google Scholar 

  14. Erdős, P.: On a lemma of Littlewood and Offord. Bull. Am. Math. Soc. 51, 898–902 (1945)

    Article  MathSciNet  MATH  Google Scholar 

  15. Guionnet, A., Krishnapur, M., Zeitouni, O.: The single ring theorem. Ann. Math. (2) 174(2), 1189–1217 (2011). doi:10.4007/annals.2011.174.2.10

    Article  MathSciNet  MATH  Google Scholar 

  16. Kahn, J., Komlós, J., Szemerédi, E.: On the probability that a random \(\pm 1\)-matrix is singular. J. Am. Math. Soc. 8(1), 223–240 (1995). doi:10.2307/2152887

    MathSciNet  MATH  Google Scholar 

  17. Komlós, J.: On the determinant of \((0,\,1)\) matrices. Stud. Sci. Math. Hung. 2, 7–21 (1967)

    MATH  Google Scholar 

  18. Komlós, J.: On the determinant of random matrices. Stud. Sci. Math. Hung. 3, 387–399 (1968)

    MathSciNet  MATH  Google Scholar 

  19. Komlós, J.: Circulated manuscript. Edited version available online at: http://www.math.rutgers.edu/~komlos/01short.pdf (1977). Accessed 16 Nov 2015

  20. McKay, B.D.: Subgraphs of random graphs with specified degrees. In: Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. II (Baton Rouge, La., 1981), vol. 33, pp. 213-223 (1981)

  21. McKay, B.D., Wang, X.: Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums. Linear Algebra Appl. 373, 273-287 (2003). doi:10.1016/S0024-3795(03)00506-8. [Special Issue on the Combinatorial Matrix Theory Conference (Pohang 2002)]

  22. Nguyen, H.H.: On the singularity of random combinatorial matrices. SIAM J. Discret. Math. 27(1), 447–458 (2013). doi:10.1137/110853157

    Article  MathSciNet  MATH  Google Scholar 

  23. Nguyen, H.H.: Random doubly stochastic matrices: the circular law. Ann. Probab. 42(3), 1161–1196 (2014). doi:10.1214/13-AOP877

    Article  MathSciNet  MATH  Google Scholar 

  24. Nguyen, H.H., Vu, V.H.: Circular law for random discrete matrices of given row sum. J. Comb. 4(1), 1–30 (2013). doi:10.4310/JOC.2013.v4.n1.a1

    MathSciNet  MATH  Google Scholar 

  25. Rudelson, M.: Lower estimates for the singular values of random matrices. C. R. Math. Acad. Sci. Paris 342(4), 247–252 (2006). doi:10.1016/j.crma.2005.11.013

    Article  MathSciNet  MATH  Google Scholar 

  26. Rudelson, M., Vershynin, R.: The Littlewood–Offord problem and invertibility of random matrices. Adv. Math. 218(2), 600–633 (2008). doi:10.1016/j.aim.2008.01.010

    Article  MathSciNet  MATH  Google Scholar 

  27. Rudelson, M., Vershynin, R.: Invertibility of random matrices: unitary and orthogonal perturbations. J. Am. Math. Soc. 27(2), 293–338 (2014). doi:10.1090/S0894-0347-2013-00771-7

    Article  MathSciNet  MATH  Google Scholar 

  28. Shamir, E., Upfal, E.: Large regular factors in random graphs. In: Convexity and Graph Theory (Jerusalem, 1981). North-Holland Math. Stud., vol. 87, pp. 271-282. North-Holland, Amsterdam (1984). doi:10.1016/S0304-0208(08)72835-4

  29. Tao, T., Vu, V.H.: On the singularity probability of random Bernoulli matrices. J. Am. Math. Soc. 20(3), 603–628 (2007). doi:10.1090/S0894-0347-07-00555-3

    Article  MathSciNet  MATH  Google Scholar 

  30. Tao, T., Vu, V.H.: Inverse Littlewood–Offord theorems and the condition number of random discrete matrices. Ann. Math. 169(2), 595–632 (2009). doi:10.4007/annals.2009.169.595

    Article  MathSciNet  MATH  Google Scholar 

  31. Tao, T., Vu, V.H.: Random matrices: universality of ESDs and the circular law. Ann. Probab. 38(5), 2023–2065 (2010). doi:10.1214/10-AOP534. (With an appendix by Manjunath Krishnapur)

    Article  MathSciNet  MATH  Google Scholar 

  32. Tao, T., Vu, V.H.: Smooth analysis of the condition number and the least singular value. Math. Comput. 79(272), 2333–2352 (2010). doi:10.1090/S0025-5718-2010-02396-8

    Article  MathSciNet  MATH  Google Scholar 

  33. Tran, L.V.: Local law for eigenvalues of random regular bipartite graphs. arXiv:1310.4606 [math]

  34. Tran, L.V., Vu, V.H., Wang, K.: Sparse random graphs: eigenvalues and eigenvectors. Random Struct. Algorithms 42(1), 110–134 (2013). doi:10.1002/rsa.20406

    Article  MathSciNet  MATH  Google Scholar 

  35. Vu, V.H.: Random discrete matrices. In: Horizons of Combinatorics. Bolyai Soc. Math. Stud., vol. 17, pp. 257-280. Springer, Berlin (2008). doi:10.1007/978-3-540-77200-2_13

  36. Wormald, N.C.: Models of random regular graphs. In: Surveys in Combinatorics, 1999 (Canterbury). London Math. Soc. Lecture Note Ser., vol. 267, pp. 239-298. Cambridge Univ. Press, Cambridge (1999)

Download references

Acknowledgments

The author thanks Terence Tao for invaluable discussions on this problem and on random matrix theory in general, as well as for helpful feedback on preliminary versions of the manuscript. Thanks also go to Ioana Dumitriu and Jamal Najim for the suggestion to consider signed rrd matrices, in large part because the proof of Theorem 1.3 inspired arguments to improve the main theorem, allowing the degree d to lower from \(n^{1/2+\varepsilon }\) to \(C\log ^2n\). Finally, the author is grateful to the anonymous referees for their careful reading and numerous corrections and suggestions to improve the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicholas A. Cook.

Additional information

Research partially supported by NSF Grant DMS-1266164.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cook, N. On the singularity of adjacency matrices for random regular digraphs. Probab. Theory Relat. Fields 167, 143–200 (2017). https://doi.org/10.1007/s00440-015-0679-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00440-015-0679-8

Keywords

  • Random matrices
  • Random regular digraphs
  • Singularity probability
  • Discrepancy property

Mathematics Subject Classification

  • 15B52