Phase transition for random walks on graphs with added weighted random matching
{{output}}
For a finite graph G = ( V , E ) let G ∗ be obtained by considering a random perfect matching of V and adding the corresponding edges to G with weight ε , while assigning weight 1 to the original edges of G. We consider whether for a sequence ( G ... ...
