Ask Bookie
{
"item_title" : "The Language of Self-Avoiding Walks",
"item_author" : [" Christian Lindorfer "],
"item_description" : "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.",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/65/824/763/3658247630_b.jpg",
"price_data" : {
"retail_price" : "69.99", "online_price" : "69.99", "our_price" : "69.99", "club_price" : "69.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
The Language of Self-Avoiding Walks : Connective Constants of Quasi-Transitive Graphs
Overview
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.
This item is Non-Returnable
Customers Also Bought
- 1
Details
- ISBN-13: 9783658247638
- ISBN-10: 3658247630
- Publisher: Springer Spektrum
- Publish Date: January 2019
- Dimensions: 8.27 x 5.83 x 0.17 inches
- Shipping Weight: 0.23 pounds
- Page Count: 65
Related Categories
You May Also Like...
- 1
