Harris' criterion and Hardy inequalites on graphs

In this paper we give a version of Harris’ criterion for determining $H_0^{1,p}$ within $H^{1,p}$ on discrete spaces. Moreover, we provide a converse via Hardy inequalities involving distances to metric boundaries.