Answers are grounded in this paper and cite their sources.
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely:
No takes yet. Share an insight, caveat, or question.
Krivelevich et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: