How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time

  • Authors:
  • David Bruce Wilson;James Gary Propp

  • Affiliations:
  • MIT Math Department;MIT Math Department

  • Venue:
  • Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract