This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–228, 1999