Language of Self-Avoiding Walks
Connective Constants of Quasi-Transitive Graphs
Häftad, Engelska, 2019
919 kr
Beställningsvara. Skickas inom 10-15 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.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.
Produktinformation
- Utgivningsdatum2019-01-15
- Mått148 x 210 x undefined mm
- FormatHäftad
- SpråkEngelska
- SerieBestMasters
- Antal sidor65
- FörlagSpringer Fachmedien Wiesbaden
- ISBN9783658247638
Tillhör följande kategorier
Hoppa över listan