1.

Record Nr.

UNINA9910309663303321

Autore

Lindorfer Christian

Titolo

The Language of Self-Avoiding Walks : Connective Constants of Quasi-Transitive Graphs / / by Christian Lindorfer

Pubbl/distr/stampa

Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Spektrum, , 2018

ISBN

3-658-24764-9

Edizione

[1st ed. 2018.]

Descrizione fisica

1 online resource (72 pages)

Collana

BestMasters, , 2625-3615

Disciplina

511.5

Soggetti

Algebra

Mathematics - Data processing

Geometry

Computational Mathematics and Numerical Analysis

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di contenuto

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.

Sommario/riassunto

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.