A study of 2-ended graphs via harmonic functions
From MaRDI portal
Flows in graphs (05C21) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Infinite graphs (05C63) Group actions on combinatorial structures (05E18) Harmonic, subharmonic, superharmonic functions on other spaces (31C05) Potential theory on Riemannian manifolds and other spaces (31C12) Discrete potential theory (31C20) Probabilistic potential theory (60J45)
Abstract: We prove that every recurrent graph quasi-isometric to admits an essentially unique Lipschitz harmonic function . If is vertex-transitive, then the action of preserves up to a sign, a fact that we exploit to prove various combinatorial results about . As a consequence, we prove the 2-ended case of the conjecture of Grimmett & Li that the connective constant of a non-degenerate vertex-transitive graph is at least the golden mean. Moreover, answering a question of Watkins from 1990, we construct a cubic, 2-ended, vertex-transitive graph which is not a Cayley graph.
This page was built for publication: A study of 2-ended graphs via harmonic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434369)