Timeline for Singularity of sparse random matrices
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2009 at 19:36 | comment | added | Kevin P. Costello | At one point I was asked a similar question (though about the group for random DENSE graphs instead of sparse ones) by Farbod Shokrieh, a graduate student at Georgia Tech. You may want to contact him and see if he's looked at this particular question at all. | |
| Nov 5, 2009 at 19:13 | comment | added | David E Speyer | We were talking about how the sandpile group of a random graph might behave. I speculated that these groups might obey the Cohen-Lenstra heuristics. We thought about graphs chosen uniformly at random from all graphs on n vertices, and made some progress. I then brought up Erdos-Renyi random graphs. We thought about it a little, and I figured I'd post what seemed to be the heart of the question here. As is you can probably tell, I didn't think about it very hard! In particular, I forgot that an Erdos-Renyi random graph has many isolated vertices! | |
| Nov 5, 2009 at 19:01 | vote | accept | David E Speyer | ||
| Nov 5, 2009 at 19:57 | |||||
| Nov 5, 2009 at 15:51 | history | answered | moonface | CC BY-SA 2.5 |