• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs

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

Paperback

Series: Bestmasters

AlgebraGeneral MathematicsGeometry

ISBN10: 3658247630
ISBN13: 9783658247638
Publisher: Springer Spektrum
Published: Jan 15 2019
Pages: 65
Weight: 0.23
Height: 0.17 Width: 5.83 Depth: 8.27
Language: English

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.

Also in

Algebra