{"product_id":"the-language-of-self-avoiding-walks-von-christian-lindorfer","title":"The Language of Self-Avoiding Walks","description":"\n                                \n                \u003cp\u003eThe 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.\u003c\/p\u003e\n                            \n            \u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783658247638\"\u003e\u003ch3\u003eConnective Constants of Quasi-Transitive Graphs\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783658247638","offer_id":39472548905053,"sku":"9783658247638","price":69.54,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/e2cebae6-a421-48ad-a644-382846fe7ba5.jpg?v=1772173169","url":"https:\/\/shop.autorenwelt.de\/products\/the-language-of-self-avoiding-walks-von-christian-lindorfer","provider":"Autorenwelt Shop","version":"1.0","type":"link"}