このページのリンク

<電子ブック>
The Language of Self-Avoiding Walks : Connective Constants of Quasi-Transitive Graphs / by Christian Lindorfer
(BestMasters. ISSN:26253615)

1st ed. 2018.
出版者 (Wiesbaden : Springer Fachmedien Wiesbaden : Imprint: Springer Spektrum)
出版年 2018
大きさ XI, 65 p. 1 illus : online resource
著者標目 *Lindorfer, Christian author
SpringerLink (Online service)
件 名 LCSH:Algebra
LCSH:Mathematics—Data processing
LCSH:Geometry
FREE:Algebra
FREE:Computational Mathematics and Numerical Analysis
FREE:Geometry
一般注記 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
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
HTTP:URL=https://doi.org/10.1007/978-3-658-24764-5
目次/あらすじ

所蔵情報を非表示

電子ブック オンライン 電子ブック

Springer eBooks 9783658247645
電子リソース
EB00196457

書誌詳細を非表示

データ種別 電子ブック
分 類 LCC:QA150-272
DC23:512
書誌ID 4000120851
ISBN 9783658247645

 類似資料