The Language of Self-Avoiding Walks : Connective Constants of Quasi-Transitive Graphs
2018 ed.
Book Details
Format
Paperback / Softback
Book Series
BestMasters
ISBN-10
3658247630
ISBN-13
9783658247638
Edition
2018 ed.
Publisher
Springer Fachmedien Wiesbaden
Imprint
Springer Spektrum
Country of Manufacture
DE
Country of Publication
GB
Publication Date
Jan 15th, 2019
Print length
65 Pages
Product Classification:
Combinatorics & graph theoryCombinatorics and graph theory
Ksh 9,900.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
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.
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.
Get The Language of Self-Avoiding Walks by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer Fachmedien Wiesbaden and it has pages.
