Go to main content

The language of self-avoiding walks : connective constants of quasi-transitive graphs / Christian Lindorfer.

Lindorfer, Christian, author.
2018
QA166
Available Online
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Add to Basket

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
The language of self-avoiding walks : connective constants of quasi-transitive graphs / Christian Lindorfer.
Author
Lindorfer, Christian, author.
ISBN
9783658247645 (electronic book)
3658247649 (electronic book)
9783658247638
3658247630
Published
Wiesbaden, Springer Spektrum, [2018]
Copyright
©2018
Language
English
Description
1 online resource
Call Number
QA166
Dewey Decimal Classification
511/.5
Summary
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.
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Source of Description
Description based on online resource; title from digital title page (viewed on February 25, 2019).
Series
BestMasters.
Available in Other Form
Print version: 9783658247638
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
Introduction
Self-avoiding walks and connective constants
Graph height functions and bridges
Self-avoiding walks on one-dimensional lattices
Context-free languages
The language of self-avoiding walks.

Browse Subjects

Show more subjects...

Statistics

from
to
Export