Timeline for Singularity of sparse random matrices
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 17, 2013 at 12:56 | history | suggested | Sergiy Kozerenko | CC BY-SA 3.0 |
TeX changes
|
| Oct 17, 2013 at 12:50 | review | Suggested edits | |||
| S Oct 17, 2013 at 12:56 | |||||
| Feb 16, 2011 at 15:35 | comment | added | Matthew Kahle | You mention Erdos-Renyi random graphs $G(n,p)$ below. Note that making $p=c/n$ with $c$ fixed might be unnecessarily restrictive. If $p$ is just slightly larger, i.e. $p \ge (1+\epsilon) \log n / n$ with $\epsilon > 0$ fixed, then the random graph is connected with probability one. As far as I can tell the question about sandpile groups makes sense and is interesting for this (or any larger) function $p=p(n)$. An interesting alternative would be to consider sandpile groups of $d$-regular graphs. Already when $d=3$ these are connected with probability one. | |
| Nov 5, 2009 at 19:57 | vote | accept | David E Speyer | ||
| Nov 5, 2009 at 19:50 | answer | added | Kenneth Maples | timeline score: 5 | |
| Nov 5, 2009 at 19:09 | answer | added | Kevin P. Costello | timeline score: 7 | |
| Nov 5, 2009 at 19:01 | vote | accept | David E Speyer | ||
| Nov 5, 2009 at 19:57 | |||||
| Nov 5, 2009 at 15:51 | answer | added | moonface | timeline score: 4 | |
| Nov 5, 2009 at 15:12 | history | edited | David E Speyer | CC BY-SA 2.5 |
added 134 characters in body
|
| Nov 5, 2009 at 15:09 | comment | added | David E Speyer | Good point! So that's the wrong question to be asking. I'll edit. | |
| Nov 5, 2009 at 15:06 | comment | added | moonface | Do you mean an n x n matrix? If so, the probability of being singular seems to be 1 as formulated in the first paragraph: Each row has a positive probability of being identically zero. Perhaps the diagonal changes this? | |
| Nov 5, 2009 at 15:02 | history | asked | David E Speyer | CC BY-SA 2.5 |