rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    non sort: The
    title: Language of Self-Avoiding Walks
    sub title: Connective Constants of Quasi-Transitive Graphs
  name:
    name part: Lindorfer, Christian.
    role:
      role term: creator
    role:
      role term: author.
    role:
      role term: aut
    role:
      role term: http://id.loc.gov/vocabulary/relators/aut
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2018
    edition: 1st ed. 2018.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XI, 65 p. 1 illus. online resource.
  abstract: 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.
  table of 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.
  note: by Christian Lindorfer.
  subject:
    topic: Algebra
  subject:
    topic: Computer mathematics
  subject:
    topic: Geometry
  subject:
    topic: Algebra
  subject:
    topic: Computational Mathematics and Numerical Analysis
  subject:
    topic: Geometry
  classification: QA150-272
  classification: 512
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: BestMasters
  identifier: 9783658247645
  identifier: https://doi.org/10.1007/978-3-658-24764-5
  record info:
    record creation date: 190107
    record change date: 20191027161226.0
    record identifier: 978-3-658-24764-5