# Sharp transition of the invertibility of the adjacency matrices of sparse random graphs

@article{Basak2018SharpTO,
title={Sharp transition of the invertibility of the adjacency matrices of sparse random graphs},
author={Anirban Basak and Mark Rudelson},
journal={Probability Theory and Related Fields},
year={2018},
volume={180},
pages={233 - 308}
}
• Published 22 September 2018
• Mathematics
• Probability Theory and Related Fields
We consider three models of sparse random graphs: undirected and directed Erdős–Rényi graphs and random bipartite graph with two equal parts. For such graphs, we show that if the edge connectivity probability p satisfies np≥logn+k(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$np\ge \log n+k(n)$$\end{document…
17 Citations
• Mathematics
Geometric and Functional Analysis
• 2021
Let ξ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek}
• Mathematics
• 2020
Let $\xi$ be a non-constant real-valued random variable with finite support, and let $M_{n}(\xi)$ denote an $n\times n$ random matrix with entries that are independent copies of $\xi$. We show that,
This paper setted the conjecture that an A_n is singular matrix with i.i.d Bernoulli entries satisfies the sparse regime when p satisfies 1-o_n(1) for some large constant $C>1$.
• Mathematics, Computer Science
• 2020
There is a universal constant C\geq 1 such that, whenever $p and$n$satisfy C\log n/n/n\leq p-1, there is a singular value of$M_n$such that it contains a zero row or column. • Mathematics, Computer Science Annales de l'Institut Henri Poincaré, Probabilités et Statistiques • 2020 The proof is slightly modified to show that the adjacency matrix of a sparse Erd\H{o}s-R\'enyi graph has simple spectrum for$n^{-1+\delta } p \leq p 1- n^{- 1+ \delta}$. • Computer Science 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) • 2022 The preconditioned Lasso can solve a large class of sparse linear regression problems nearly optimally: it succeeds whenever the dependency structure of the covariates, in the sense of the Markov property, has low treewidth - even if$\Sigma$is highly ill-conditioned. • Mathematics, Computer Science Comb. Probab. Comput. • 2022 If the random matrix of a Bernoulli model is nonsingular with probability n/n for any constant$\varepsilon>0\$ , then the model is combinatorial and this resolves a conjecture of Aigner-Horev and Person.
• Mathematics, Computer Science
• 2021
The corank of A is equal to the number of isolated vertices remaining in G after the Karp-Sipser leaf-removal process, which removes vertices of degree one and their unique neighbor, and the k-core of G(n, p) is full rank for any k ≥ 3 and p = ω(1/n).
• Mathematics, Computer Science
• 2022
The authors' sharp bounds imply that there are no outliers outside the support of the Marˇcenko-Pastur law almost surely, which extends the Bai-Yin theorem to sparse rectangular random matrices.
We consider an Erdős-Rényi graph G(n, p) on n vertices with edge probability p such that