Timeline for The matrix tree theorem for weighted graphs
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2017 at 12:36 | comment | added | Steve Huntsman | @darijgrinberg should be in your email. It's not very readable though. | |
| May 2, 2017 at 4:53 | comment | added | darij grinberg | Is there any readable long-form exposition of this all (for mathematicians, with ELI5s of the relevant biology)? I have taught the BEST theorem this term, and I had no idea that it had practical implications; that would have made it a far BETTER theorem at that point of my class. | |
| Apr 10, 2012 at 9:27 | vote | accept | bc919 | ||
| Jan 2, 2010 at 18:25 | comment | added | Steve Huntsman | PS. This can be thought of more abstractly as a way of exactly computing the partition function for what I would call "quantized-bond Potts models". A generalization of the matrix-tree theorem to hypergraphs could allow one to enumerate de Bruijn tori and conceivably solve the two-dimensional Ising model with applied field. Of course, these all turn out to be rather resistant to attack. | |
| Jan 2, 2010 at 18:19 | history | edited | Steve Huntsman | CC BY-SA 2.5 |
added 68 characters in body; edited body
|
| Jan 2, 2010 at 18:14 | history | answered | Steve Huntsman | CC BY-SA 2.5 |