Cogrowth of regular graphs

Northshield, S.

doi:10.1090/S0002-9939-1992-1120509-0

Cogrowth of regular graphs
HTML articles powered by AMS MathViewer

by S. Northshield PDF

Proc. Amer. Math. Soc. 116 (1992), 203-205 Request permission

Abstract:

Let $\mathcal {G}$ be a $d$-regular graph and $T$ the covering tree of $\mathcal {G}$. We define a cogrowth constant of $\mathcal {G}$ in $T$ and express it in terms of the first eigenvalue of the Laplacian on $\mathcal {G}$. As a corollary, we show that the cogrowth constant is as large as possible if and only if the first eigenvalue of the Laplacian on $\mathcal {G}$ is zero. Grigorchuk’s criterion for amenability of finitely generated groups follows.

References

Joel M. Cohen, Cogrowth and amenability of discrete groups, J. Funct. Anal. 48 (1982), no. 3, 301–309. MR 678175, DOI 10.1016/0022-1236(82)90090-8
Yves Derriennic and Yves Guivarc’h, Théorème de renouvellement pour les groupes non moyennables, C. R. Acad. Sci. Paris Sér. A-B 277 (1973), A613–A615 (French). MR 328990
Jozef Dodziuk and Leon Karp, Spectral and function theory for combinatorial Laplacians, Geometry of random motion (Ithaca, N.Y., 1987) Contemp. Math., vol. 73, Amer. Math. Soc., Providence, RI, 1988, pp. 25–40. MR 954626, DOI 10.1090/conm/073/954626
R. I. Grigorchuk, Symmetrical random walks on discrete groups, Multicomponent random systems, Adv. Probab. Related Topics, vol. 6, Dekker, New York, 1980, pp. 285–325. MR 599539
Harry Kesten, Full Banach mean values on countable groups, Math. Scand. 7 (1959), 146–156. MR 112053, DOI 10.7146/math.scand.a-10568
S. Northshield, Gauge and conditional gauge on negatively curved graphs, Stochastic Anal. Appl. 9 (1991), no. 4, 461–482. MR 1133859, DOI 10.1080/07362999108809251
Alan L. T. Paterson, Amenability, Mathematical Surveys and Monographs, vol. 29, American Mathematical Society, Providence, RI, 1988. MR 961261, DOI 10.1090/surv/029