Home
The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs
Barnes and Noble
Loading Inventory...
The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs in Franklin, TN
Current price: $69.99

Barnes and Noble
The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs in Franklin, TN
Current price: $69.99
Loading Inventory...
Size: OS
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.
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.