The Language of Self-Avoiding Walks

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

Sale price  $62.99 Regular price $69.99
Skip to product information
The Language of Self-Avoiding Walks

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

Sale price  $62.99 Regular price $69.99

Reliable shipping

Flexible returns

BestMasters

The Language of Self-Avoiding Walks

Connective Constants of Quasi-Transitive Graphs

Christian Lindorfer

Mathematics / Algebra / General

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.

Christian Lindorfer wrote his master’s thesis under the supervision of Prof. Dr. Wolfgang Woess at the Institute of Discrete Mathematics at Graz University of Technology, Austria.


Publication Date: 15 January 2019
Publisher: Springer Fachmedien Wiesbaden
Imprint: Springer Spektrum
ISBN-13: 9783658247638
Format: Paperback softback
Page Count: 65

You may also like