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

• Κύριος συγγραφέας: Lindorfer, Christian (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Wiesbaden : Springer Fachmedien Wiesbaden : Imprint: Springer Spektrum, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: BestMasters,
• Θέματα: Algebra.; Computer mathematics.; Geometry.; Computational Mathematics and Numerical Analysis.

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 us...

Πίνακας περιεχομένων:

• Graph Height Functions and Bridges
• Self-Avoiding Walks on One-Dimensional Lattices
• The Algebraic Theory of Context-Free Languages
• The Language of Walks on Edge-Labelled Graphs.