Knygos.lt nariams
Knygos.lt nariams
- Išsiųsime per 12–18 d.d.
/images/books/13226262/9783658247638.jpg)
- Autorius: Christian Lindorfer
- Leidėjas: Springer Spektrum
- ISBN-10: 3658247630
- ISBN-13: 9783658247638
- Formatas: 14.8 x 21 x 0.4 cm, minkšti viršeliai
- Kalba: Anglų
Atsiliepimai
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.
- Autorius: Christian Lindorfer
- Leidėjas: Springer Spektrum
- ISBN-10: 3658247630
- ISBN-13: 9783658247638
- Formatas: 14.8 x 21 x 0.4 cm, minkšti viršeliai
- Kalba: Anglų
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.
Atsiliepimai