Timeline for Wait time to grid network disconnection with failing edges
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2014 at 15:51 | comment | added | Jon Peterson | If you let $p(t) = P(\delta > t)$ be the probability that a fixed edge is still present after time $t$, then $G_n(t)$ is an i.i.d. bond percolation on the torus with parameter $p(t)$. I don't know that much about bond percolation, but I'm guessing that there are known results on the probability that a bond percolation on the torus gives a connected graph. | |
| May 20, 2014 at 10:33 | vote | accept | Joseph O'Rourke | ||
| May 19, 2014 at 1:24 | answer | added | Jan Kyncl | timeline score: 5 | |
| May 19, 2014 at 0:06 | answer | added | The Masked Avenger | timeline score: 3 | |
| May 18, 2014 at 21:11 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |