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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Wiesbaden :
Springer Fachmedien Wiesbaden : Spektrum,
2018.
|
| Vydání: | 1st ed. 2018. |
| Edice: | BestMasters,
|
| Témata: | |
| ISBN: | 9783658247645 |
| ISSN: | 2625-3577 |
| On-line přístup: |
|
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- 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.