Cantitate/Preț
Produs

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

Autor Christian Lindorfer
en Limba Engleză Paperback – 15 ian 2019
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.
Citește tot Restrânge

Din seria BestMasters

Preț: 46491 lei

Nou

Puncte Express: 697

Preț estimativ în valută:
8900 9251$ 7379£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783658247638
ISBN-10: 3658247630
Pagini: 65
Ilustrații: XI, 65 p. 1 illus.
Dimensiuni: 148 x 210 mm
Greutate: 0.1 kg
Ediția:1st ed. 2018
Editura: Springer Fachmedien Wiesbaden
Colecția Springer Spektrum
Seria BestMasters

Locul publicării:Wiesbaden, Germany

Cuprins

Graph 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.

Notă biografică

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.


Textul de pe ultima copertă

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.
Contents
  • Graph 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
Target Groups
  • Researchers and students in the fields of graph theory, formal language theory and combinatorics
  • Experts in these areas
The Author
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.

Caracteristici

Publication in the field of mathematics