| Document Type
|
:
|
BL
|
| Record Number
|
:
|
881614
|
| Main Entry
|
:
|
Lindorfer, Christian
|
| Title & Author
|
:
|
The language of self-avoiding walks : : connective constants of quasi-transitive graphs /\ Christian Lindorfer.
|
| Publication Statement
|
:
|
Wiesbaden :: Springer Spektrum,, [2018]
|
|
|
:
|
, ©2018
|
| Series Statement
|
:
|
BestMasters
|
| Page. NO
|
:
|
1 online resource
|
| ISBN
|
:
|
3658247649
|
|
|
:
|
: 9783658247645
|
|
|
:
|
3658247630
|
|
|
:
|
9783658247638
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references.
|
| Contents
|
:
|
Introduction -- Self-avoiding walks and connective constants -- Graph height functions and bridges -- Self-avoiding walks on one-dimensional lattices -- Context-free languages -- The language of self-avoiding walks.
|
| Abstract
|
:
|
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.
|
| Subject
|
:
|
Graph theory.
|
| Subject
|
:
|
Random walks (Mathematics)
|
| Subject
|
:
|
Graph theory.
|
| Subject
|
:
|
Random walks (Mathematics)
|
| Dewey Classification
|
:
|
511/.5
|
| LC Classification
|
:
|
QA166.L56 2018eb
|