Timeline for Change in the average geodesic distance of a graph when flipping a single edge
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2011 at 18:47 | vote | accept | Rorsa | ||
| May 23, 2011 at 22:54 | answer | added | John Pardon | timeline score: 2 | |
| May 21, 2011 at 19:20 | comment | added | Ori Gurel-Gurevich | Tom: it could be that the graph consists of 2 parts with 2 edges between them such that you would have to go through one of these edges, but neither is pivotal - removing either would not change the average at all. | |
| May 21, 2011 at 16:30 | comment | added | Tom Church | An idle question: could it be true that if the average change in distance is low enough, then your graph is an expander? (This question will not help solve the original question, which is about efficiently computing the average change.) | |
| May 21, 2011 at 15:39 | history | edited | Rorsa | CC BY-SA 3.0 |
added 134 characters in body; added 132 characters in body
|
| May 21, 2011 at 15:33 | history | asked | Rorsa | CC BY-SA 3.0 |