Abstract
We study random walks on undirected graphs with weighted edges. Our main result shows that any spanning tree defined by the edges corresponding to a first visit of a vertex, appears with a probability proportional to its weight, which is the product of the weight of its edges. This provides an algorithm for generating non uniform random spanning trees in a weighted graph. The technique used here is based on linear equations over regular expressions and finite automata theory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
