Cactus Trees, and Estimations of the Spectral Radius of Vertex-Transitive Graphs

Details Cactus Trees, and Estimations of the Spectral Radius of Vertex-Transitive Graphs Cactus Trees, and Estimations of the Spectral Radius of Vertex-Transitive Graphs

2001-12-12

arxiv.org/abs/math/0112108v2

Random walks and geometry, 349--361, Walter de Gruyter GmbH & Co. KG, Berlin, 2004

Mathematics

Group Theory

12 pages, 1 figure

Scientific paper

This paper gives lower bounds on the spectral radius of vertex-transitive graphs, based on the number of ``prime cycles'' at a vertex. The bounds are obtained by constructing circuits in the graph that resemble ``cactus trees'', and enumerating them. Counting these circuits gives a coefficient-wise underestimation of the Green function of the graph, and hence and underestimation of its spectral radius. The bounds obtained are very good for the Cayley graph of surface groups of genus g>=2, with standard generators (these graphs are the 1-skeletons of tessellations of hyperbolic plane by 4g-gons, 4g per vertex). We have for example for g=2 0.662420<=|M|<=0.662816, and for g=3 0.552773<=|M|<=0.552792.

Affiliated with

Also associated with

No associations

Rating

Cactus Trees, and Estimations of the Spectral Radius of Vertex-Transitive Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cactus Trees, and Estimations of the Spectral Radius of Vertex-Transitive Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cactus Trees, and Estimations of the Spectral Radius of Vertex-Transitive Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-82598