Timeline for Shortest grid-graph paths with random diagonal shortcuts
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 14, 2010 at 23:14 | comment | added | Joseph O'Rourke | I computed $d_n$ out to $n=200$ to try to confirm the 2/3's power, but (a) the variance is large, so I need to run many simulations, and (b) it looks like I'd have to extend to $n=1000$ to see the trend clearly. So don't hold your breath waiting on confirmation. | |
| Nov 13, 2010 at 23:36 | comment | added | Tom LaGatta | It's my pleasure! I always enjoy your questions, Joseph. I'd love to chat with you in person sometime. Please drop me a line if you find yourself in New York, and I'll do the same if I find myself in western Massachusetts. | |
| Nov 13, 2010 at 23:25 | comment | added | Joseph O'Rourke | At least some of your conjectures are testable, perhaps within the range of my computational facilities. I will enjoy exploring these as time permits. Thanks for your expert attention! | |
| Nov 13, 2010 at 23:20 | comment | added | Tom LaGatta | I should further state that in most models, there is no way to compute the constant $\mu$. Your model is simple and geometric, however, and sleepless in beantown's recursive algorithm may give an explicit formula for $\mu$. | |
| Nov 13, 2010 at 23:13 | history | edited | Tom LaGatta | CC BY-SA 2.5 |
added 174 characters in body
|
| Nov 13, 2010 at 23:06 | history | answered | Tom LaGatta | CC BY-SA 2.5 |