Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (6 chapters)
Keywords
About this book
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.
Authors and Affiliations
About the author
Christian Lindorfer wrote his master’s thesis under the supervision of Prof. Dr. Wolfgang Woess at the Institute of Discrete Mathematics at Graz University of Technology, Austria.
Bibliographic Information
Book Title: The Language of Self-Avoiding Walks
Book Subtitle: Connective Constants of Quasi-Transitive Graphs
Authors: Christian Lindorfer
Series Title: BestMasters
DOI: https://doi.org/10.1007/978-3-658-24764-5
Publisher: Springer Spektrum Wiesbaden
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2018
Softcover ISBN: 978-3-658-24763-8Published: 15 January 2019
eBook ISBN: 978-3-658-24764-5Published: 07 January 2019
Series ISSN: 2625-3577
Series E-ISSN: 2625-3615
Edition Number: 1
Number of Pages: XI, 65
Number of Illustrations: 1 b/w illustrations
Topics: Algebra, Computational Mathematics and Numerical Analysis, Geometry