Timeline for Random noncrossing chords of a circle
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Apr 23, 2017 at 15:53 | history | suggested | Martin Sleziak |
removed deprecated (geometry) tag - see the tag info: http://mathoverflow.net/tags/geometry/info
|
|
Apr 23, 2017 at 15:40 | review | Suggested edits | |||
S Apr 23, 2017 at 15:53 | |||||
Apr 23, 2017 at 13:49 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
Sep 2, 2010 at 23:43 | history | edited | Joseph O'Rourke | CC BY-SA 2.5 |
Addendum, thanks, and a specific question isolated.
|
Sep 2, 2010 at 14:50 | answer | added | user8965 | timeline score: 8 | |
Sep 2, 2010 at 14:05 | comment | added | j.c. | oops, I misstated the result: the positive walks are those starting at 0 and first returning to 0 after 2(n-1) steps of +1 or -1 | |
Sep 2, 2010 at 13:57 | comment | added | Joseph O'Rourke | @jc: No, I was not familiar. Must be this paper: "Triangulating the Circle at Random." Amer. Math. Monthly 101 (1994) 223-233. I will investigate. Thanks! | |
Sep 2, 2010 at 13:52 | comment | added | j.c. | are you aware of the work by David Aldous on random triangulations of the circle? there's a nice American Mathematical Monthly article of his from 1991 reviewing that construction. He considers triangulations of regular n-gons as n goes to infinity, and chooses triangulations uniformly from that set. in this case the dual trees are binary trees and there is a series of bijections to positive walks from 0 to 2(n-1) which in the large n limit tend to Brownian excursions after rescaling. | |
Sep 2, 2010 at 13:51 | answer | added | Gjergji Zaimi | timeline score: 12 | |
Sep 2, 2010 at 13:18 | history | asked | Joseph O'Rourke | CC BY-SA 2.5 |