Timeline for First passage percolation for general graphs
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 22, 2015 at 13:55 | comment | added | Boris Bukh | The expectation of the shortest path distance is infinite (since with non-zero probability s is isolated). It is probably unintentional, but the intended question is not clear. | |
Sep 22, 2015 at 6:59 | vote | accept | Aaron Schild | ||
Sep 22, 2015 at 6:59 | |||||
Sep 22, 2015 at 6:48 | vote | accept | Aaron Schild | ||
Sep 22, 2015 at 6:57 | |||||
Sep 22, 2015 at 6:36 | answer | added | Anthony Quas | timeline score: 2 | |
Sep 22, 2015 at 6:04 | review | Close votes | |||
Sep 24, 2015 at 6:56 | |||||
Sep 22, 2015 at 3:09 | history | edited | Aaron Schild |
edited tags
|
|
Sep 22, 2015 at 3:04 | review | First posts | |||
Sep 22, 2015 at 3:10 | |||||
Sep 22, 2015 at 3:01 | history | asked | Aaron Schild | CC BY-SA 3.0 |