Timeline for Asymptotic formula for average geodesic length on graph?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2016 at 18:51 | vote | accept | ABIM | ||
| May 26, 2016 at 18:50 | comment | added | ABIM | Perfect, thanks Igor (I was hoping there would be some deep explanatory result but i guess there does not seem to be one). Thanks again Igor. | |
| May 26, 2016 at 17:40 | comment | added | Igor Rivin | @CSA Well, for example, in a cycle graph, the average path length is linear (you can increase the degree by growing "hair" out of the graph.) In a $d$-regular tree, the average distance is logarithmic. An expander graph (look at the wikipedia article, e.g.) looks a lot like a tree... | |
| May 26, 2016 at 16:43 | comment | added | ABIM | Interesting... could you elaborate or provide a reference? Thanks | |
| May 26, 2016 at 16:17 | history | answered | Igor Rivin | CC BY-SA 3.0 |