A note on Liouville type equations on graphs

TL;DR

This paper investigates Liouville equations on graphs, establishing a uniform lower bound for the energy of solutions, with specific results for the 2D lattice graph, extending understanding of nonlinear equations on discrete structures.

Contribution

It proves the existence of a uniform lower bound for the energy of solutions to Liouville equations on graphs, applying isoperimetric inequalities and extending prior continuous results to discrete graphs.

Findings

Existence of a uniform lower bound for energy on graphs

Lower bound explicitly calculated for the 2D lattice graph

Extension of Liouville equation analysis from continuous to discrete settings

Abstract

In this note, we study the Liouville equation $\Delta u = -e^u$ on a graph G satisfying certain isoperimetric inequality. Following the idea of W. Ding, we prove that there exists a uniform lower bound for the energy, $\Sigma_G e^u$ of any solution $u$, to the equation. In particular, for the 2-dimensional lattice graph $Z^2$; the lower bound is given by 4.