Applied to Load Balanced Spanning Tree
A state is a spanning tree.
T’ is a neighbor of T if it can be obtained by deletion of an edge in T and insertion of an edge not in T.
Energy of a spanning tree T is its cost, c(T).
- If T’ is the random neighbor of T then dE = c(T’) - c(T).
Probability of moving to a higher energy state is e-(c(T’) -c(T))/kT
- Higher if either c(T’) - c(T) is small or T is large.
- Low if either c(T’) - c(T) is large or T is small.