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

preprint2022arXivOpen access

Abstract

Let A∈Rn×nA \in \mathbb{R}^{n \times n} be the adjacency matrix of an Erdős Rényi graph G(n,d/n)G(n, d/n) for d=ω(1)d = ω(1) and d≤3log⁡(n)d \leq 3\log(n). We show that as nn goes to infinity, with probability that goes to 11, the adjacency matrix of the 33-core of G(n,d/n)G(n, d/n) is invertible.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.