Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

Cogrowth of regular graphs


Author: S. Northshield
Journal: Proc. Amer. Math. Soc. 116 (1992), 203-205
MSC: Primary 60J15; Secondary 05C05, 43A05
MathSciNet review: 1120509
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 60J15, 05C05, 43A05

Retrieve articles in all journals with MSC: 60J15, 05C05, 43A05


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9939-1992-1120509-0
PII: S 0002-9939(1992)1120509-0
Keywords: Regular graph, covering tree, amenable group, random walk
Article copyright: © Copyright 1992 American Mathematical Society