Timeline for How many distinct eigenvalues does a random graph have?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2013 at 10:48 | vote | accept | Felix Goldberg | ||
| Apr 22, 2013 at 14:49 | answer | added | Terry Tao | timeline score: 14 | |
| Apr 22, 2013 at 4:15 | comment | added | Brendan McKay | Pretty sure it isn't known, though most people would conjecture the even stronger result that the characteristic polynomial is usually irreducible. Chris Godsil will give us an authoritative answer shortly. | |
| Apr 22, 2013 at 1:43 | comment | added | Andreas Blass | I assumed the question referred to the asymptotic behavior of large finite random graphs. That might make a big difference, since the infinite random graph has lots of automorphisms, while finite random graphs are rigid with asymptotic probability 1. | |
| Apr 21, 2013 at 22:13 | comment | added | Goldstern | Do you mean the eigenvectors (in $\ell_1$) of the adjacency matrix of the infinite Rado graph? | |
| Apr 21, 2013 at 20:27 | comment | added | Andreas Blass | Have you looked in Bollobas's book on random graphs? I'd expect all the eigenvalues to be distinct (with asymptotic probability 1), but I don't know that for a fact. | |
| Apr 21, 2013 at 17:55 | history | asked | Felix Goldberg | CC BY-SA 3.0 |