- We will send in 10–14 business days.
/images/books/13226262/9783658247638.jpg)
- Author: Christian Lindorfer
- Publisher: Springer Spektrum
- ISBN-10: 3658247630
- ISBN-13: 9783658247638
- Format: 14.8 x 21 x 0.4 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.20:18:22
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Christian Lindorfer
- Publisher: Springer Spektrum
- ISBN-10: 3658247630
- ISBN-13: 9783658247638
- Format: 14.8 x 21 x 0.4 cm, minkšti viršeliai
- Language: English English
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.
Reviews