Free Delivery Over $100
|
|
|||
|
||||
OverviewThe 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. Full Product DetailsAuthor: Christian LindorferPublisher: Springer Fachmedien Wiesbaden Imprint: Springer Spektrum Edition: 1st ed. 2018 Weight: 0.454kg ISBN: 9783658247638ISBN 10: 3658247630 Pages: 65 Publication Date: 15 January 2019 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand  We will order this item for you from a manufactured on demand supplier. Table of ContentsGraph 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.ReviewsAuthor InformationChristian 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. Tab Content 6Author Website:Countries AvailableAll regions |
||||
