Cogrowth of Regular Graphs

Loading...
Thumbnail Image
Authors
Northshield, Sam
Issue Date
1992
Type
Article
Language
Keywords
Regular graph , covering tree , amenable group , random walk
Research Projects
Organizational Units
Journal Issue
Alternative Title
Abstract
Let G be a d-regular graph and T the covering tree of G. We define a cogrowth constant of G in T and express it in terms of the first eigenvalue of the Laplacian on 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 G is zero. Grigorchuk's criterion for amenability of finitely generated groups follows.
Description
This article has been published in the September 1992 issue of Proceedings of the American Mathematical Society.
Citation
Northshield, S. (1992). Cogrowth of Regular Graphs. Proceedings of the American Mathematical Society, 116(1). http://doi.org/10.1090/S0002-9939-1992-1120509-0
Publisher
Proceedings of the American Mathematical Society
License
Journal
Volume
Issue
PubMed ID
DOI
ISSN
EISSN