We prove a Harnack inequality for Dirichlet eigenfunctions of abelian homog
eneous graphs and their convex subgraphs. We derive lower bounds for Dirich
let eigenvalues using the Harnack inequality. We also consider a randomizat
ion problem in connection with combinatorial games using Dirichlet eigenval
ues. (C) 2000 John Wiley & Sons, Inc.