A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
In this paper we extend the loop-erased random walk (LERW) to the directed hypergraph setting. We then generalize Wilson's algorithm for uniform sampling of spanning trees to directed hypergraphs. In several special cases, this algorithm perfectly samples spanning hypertrees in expected polynomial time. Our main application is to the reachability problem, also known as the directed all-terminal network reliability problem. This classical problem is known to be #P -complete, hence is most likelydoi:10.1002/rsa.20460 fatcat:e4g66vwmbrdptmvo4ueuuvzziu