BestMasters: Connective Constants of Quasi-Transitive Graphs

Lindorfer, Christian

The connective constant of a quasi-transitive infinite graph is a measure for the asymptotic growth rate of the number of self-avoiding walks of length n from a given starting vertex. On edge-labelled graphs the formal language of self-avoiding walks is generated by a formal grammar, which can be used to calculate the connective constant of the graph. Christian Lindorfer discusses the methods in some examples, including the infinite ladder-graph and the sandwich of two regular infinite trees.

Details

Published by: Springer Spektrum

Publication Date: 2019-01-15

Format: Paperback

ISBN-13: 9783658247638

DOI: 10.1007/978-3-658-24764-5

Dimensions: 210cm x148cm

Pages: 65