Articles liés à The Language of Self-Avoiding Walks: Connective Constants...

The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs - Couverture souple

Livre 63 sur 91: BestMasters

Lindorfer, Christian

 
9783658247638: The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l'auteur

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.