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

-15% su kodu: ENG15
93,58 
Įprasta kaina: 110,09 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
93,58 
Įprasta kaina: 110,09 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
2025-02-28 110.0900 InStock
Nemokamas pristatymas į paštomatus per 11-15 darbo dienų užsakymams nuo 10,00 

Knygos aprašymas

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.

Informacija

Autorius: Christian Lindorfer
Serija: BestMasters
Leidėjas: Springer Fachmedien Wiesbaden
Išleidimo metai: 2019
Knygos puslapių skaičius: 80
ISBN-10: 3658247630
ISBN-13: 9783658247638
Formatas: 210 x 148 x 5 mm. Knyga minkštu viršeliu
Kalba: Anglų

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs“

Būtina įvertinti prekę

Goodreads reviews for „The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs“