tag:blogger.com,1999:blog-8890204.post4738326248119551927..comments2024-02-26T01:30:54.091-05:00Comments on My Biased Coin: BubbleSearchMichael Mitzenmacherhttp://www.blogger.com/profile/06738274256402616703noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-8890204.post-92214698997174981582007-08-10T15:15:00.000-04:002007-08-10T15:15:00.000-04:00Thanks, this is neat. This is a nice way to produ...Thanks, this is neat. This is a nice way to produce a random perturbation of a given ordering. I wonder if any "smoothed complexity" type of result can be proved with this perturbation model.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-83957012216284494832007-08-10T15:10:00.000-04:002007-08-10T15:10:00.000-04:00Clones -- I set up the blog for my "old" gmail acc...Clones -- I set up the blog for my "old" gmail account, but recently set up a second (to help remove spam from my Harvard mail account). So I gave myself access from both accounts. Sadly (for me), I find there's still just one of me...Michael Mitzenmacherhttps://www.blogger.com/profile/02161161032642563814noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-27212999336721806572007-08-10T11:42:00.000-04:002007-08-10T11:42:00.000-04:00This heuristic is pretty neat. I generally like th...This heuristic is pretty neat. I generally like theorems that are simple to describe (e.g., how to do bubble sort) and whose result is simple to describe (e.g., the transition probability depends only on distance) even if the intermediate steps are messy (although I would guess they aren't here).<BR/><BR/>Do you think this could be used to get some sort of useful Markov chain on constrained ordering problems?<BR/><BR/>Also - where did you get the clones? I see two MMs contributing to the blog...Anonymousnoreply@blogger.com