Learned this in my randomized algorithms class today, and it was pretty interesting so I thought I'd share it. There is apparently a dual between computing resistance in a resistor network, and computing expected hitting time of a random walk in a graph! The problems at first seem completely unrelated and yet they are duals -- that is, if you solve one you've also solved the other.