The Language of Self-Avoiding Walks Connective - Constants...

Main
Mathematics
The Language of Self-Avoiding Walks...

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

Name: The Language of Self-Avoiding Walks Connective - Constants of Quasi-Transitive Graphs
ISBN: 9783658247638

Lindorfer, Christian

0 / 0

0 comments

この本はいかがでしたか？

ファイルの質はいかがですか？

質を評価するには、本をダウンロードしてください。

ダウンロードしたファイルの質はいかがでしたか？

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.

カテゴリー:

Mathematics

年:

2018

版:

出版社:

Springer

言語:

english

ISBN 10:

3658247630

ISBN 13: