Bibliografie

Detailansicht

The Language of Self-Avoiding Walks

eBook - Connective Constants of Quasi-Transitive Graphs, BestMasters
SPEKTRUM AKADEMISCHER VERLAG BEI
ISBN/EAN: 9783658247645
Umbreit-Nr.: 6215230

Sprache: Englisch
Umfang: 0 S., 0.77 MB
Format in cm:
Einband: Keine Angabe

Erschienen am 07.01.2019
Auflage: 1/2019


E-Book
Format: PDF
DRM: Digitales Wasserzeichen
€ 80,95
(inklusive MwSt.)
Sofort Lieferbar
Beim Buchhandel bestellen
  • Zusatztext

    • <p>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.</p>

  • Kurztext

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

  • Autorenportrait
    • <p>Christian Lindorfer wrote his masters thesis under the supervision of Prof. Dr. Wolfgang Woess at the Institute of Discrete Mathematics at Graz University of Technology, Austria.<br></p>