Nonamenable Liouville Graphs
classification
🧮 math.MG
math.PR
keywords
graphleveladmitsbinaryboundededgesexpanderfunctions
read the original abstract
Add to each level of binary tree edges to make the induced graph on the level a uniform expander. It is shown that such a graph admits no non-constant bounded harmonic functions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.