The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs (1st ed. 2018) (BestMasters)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2018
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783658247645
- Related ISBNs:
- 9783658247638
- Publisher:
- Springer Fachmedien Wiesbaden
- Date of Addition:
- 01/19/19
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.