
arXiv: 2309.13728
We show that a discrete harmonic function which is bounded on a large portion of a periodic planar graph is constant. A key ingredient is a new unique continuation result for the weighted graph Laplacian. The proof relies on the structure of level sets of discrete harmonic functions, using arguments as in Bou-Rabee--Cooperman--Dario (2023) which exploit the fact that, on a planar graph, the sub- and super-level sets cannot cross over each other. In the special case of the square lattice this yields a new, geometric proof of the Liouville theorem of Buhovsky--Logunov--Malinnikova--Sodin (2017).
12 pages, 5 figures; minor improvement of exposition
supercritical percolation cluster, Graphs and linear algebra (matrices, eigenvalues, etc.), Probability (math.PR), Analysis of PDEs, FOS: Mathematics, weighted graph Laplacian, harmonic functions, Planar graphs; geometric and topological aspects of graph theory, Signed and weighted graphs, Probability, Analysis of PDEs (math.AP)
supercritical percolation cluster, Graphs and linear algebra (matrices, eigenvalues, etc.), Probability (math.PR), Analysis of PDEs, FOS: Mathematics, weighted graph Laplacian, harmonic functions, Planar graphs; geometric and topological aspects of graph theory, Signed and weighted graphs, Probability, Analysis of PDEs (math.AP)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
