Timeline for Distribution on permutations derived from probability of pairwise orderings
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2010 at 2:51 | history | edited | Suresh Venkat | CC BY-SA 2.5 |
added 802 characters in body
|
| Jun 6, 2010 at 21:56 | comment | added | David R. MacIver | I suspect you may be right that the problem is intractable in general. Unfortunately I don't think there's likely to be much deeper structure in the problem unfortunately. However the chances are good that the original P may be close to R, as they're derived from data which is likely to be "close" to being modelled by the described process. So if there's some iterative process which converges on the result perhaps it would converge quickly in my observed case even if it has bad general performance? | |
| Jun 6, 2010 at 21:23 | history | answered | Suresh Venkat | CC BY-SA 2.5 |