Invertibility of the 3-core of Erdos Renyi Graphs with Growing Degree


الملخص بالإنكليزية

Let $A in mathbb{R}^{n times n}$ be the adjacency matrix of an ErdH{o}s Renyi graph $G(n, d/n)$ for $d = omega(1)$ and $d leq 3log(n)$. We show that as $n$ goes to infinity, with probability that goes to $1$, the adjacency matrix of the $3$-core of $G(n, d/n)$ is invertible.

تحميل البحث