On the mean value of probability measures on circular graphs

We introduce and discuss a class of difference equations motivated by a problem from combinatorial optimization on graphs. The local behavior at stationary points is investigated in detail, and in the course of this investigation we prove a stability result for certain types of non-isolated stationary points. Results include a complete characterization of the behavior on chain graphs, and a characterization of the local behavior for circular graphs.