Timeline for How to uniformly sample a square (0,1)-matrix whose trace is 0 and whose row sums and column sums are the same?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 4, 2019 at 7:21 | history | edited | Brendan McKay | CC BY-SA 4.0 |
added 343 characters in body
|
| Jan 3, 2019 at 18:53 | comment | added | KPU | Thank you so much for the very helpful information! I am indeed looking for the algorithm for small m. Is there a way to generate the matrix with the additional constraint of a 0 trace? I guess I can permute the rows and columns, but I would like to know if there is a more efficient way. Thank you so much again! | |
| Jan 3, 2019 at 4:43 | history | answered | Brendan McKay | CC BY-SA 4.0 |