Abstract
Loop measures and their associated loop soups are generally viewed as arising from finite state Markov chains. We generalize several results to loop measures arising from potentially complex edge weights. We discuss two applications: Wilson’s algorithm to produce uniform spanning trees and an isomorphism theorem due to Le Jan.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have