Abstract
AbstractWe consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any finite measure intrinsic metric. Furthermore, we show that a graph is canonically compactifiable if and only if the space of functions of finite energy is an algebra. These results answer questions in a recent work of Georgakopoulos, Haeseler, Keller, Lenz, and Wojciechowski.
Publisher
Springer Science and Business Media LLC
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Recurrent and (strongly) resolvable graphs;Journal de Mathématiques Pures et Appliquées;2024-06