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

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

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

Full description

Bibliographic Details
Main Author: Lindorfer, Christian (Author, http://id.loc.gov/vocabulary/relators/aut)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Wiesbaden : Springer Fachmedien Wiesbaden : Imprint: Springer Spektrum, 2018.
Edition:1st ed. 2018.
Series:BestMasters,
Subjects:
Algebra.
Computer mathematics.
Geometry.
Computational Mathematics and Numerical Analysis.
Online Access:Full Text via HEAL-Link
Table of Contents:
  • 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.

Similar Items