The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs

By Christian Lindorfer

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.

• Format: Paperback
• Language: English
• ISBN: 3658247630
• ISBN13: 9783658247638
• Release Date: January 2019
• Publisher: Springer Spektrum
• Length: 65 Pages
• Weight: 0.23 lbs.
• Dimensions: 0.2" x 5.8" x 8.3"