Link Download ebook Free: https://ouo.io/cS1bXA The Language of Self-Avoiding Walks Connective Constants of Quasi-Transitive Graphs By: Christian Lindorfer Publisher: Springer Spektrum Print ISBN: 9783658247638, 3658247630 eText ISBN: 9783658247645, 3658247649 Copyright year: 2018 Format: PDF Available from $ 69.99 USD SKU 9783658247645 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.
