Previous works have shown that arctic circle phenomenons and limiting behaviors
of some integer valued discrete systems can be explained by a variational principle.
In this talk we will present the first results of the same type of results with
graph homomorphisms form Z^d to a regular tree. We will also explain how the
technique used could be applied to other non-integrable models.