On a Lemma of Gromov and the Entropy of a Graph

If G is a finite, directed, simple and irreducible graph, deletion of an edge makes the entropy decrease. We give a proof of this fact that avoids the Perron–Frobenius theorem and makes use of a technique developed by Gromov.