國立虎尾科技大學 |

The Language of Self-Avoiding Walks = Connective Constants of Quasi-Transitive Graphs /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Language of Self-Avoiding Walks/ by Christian Lindorfer.
其他題名:	Connective Constants of Quasi-Transitive Graphs /
作者:	Lindorfer, Christian.
面頁冊數:	XI, 65 p. 1 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algebra. -
電子資源:	https://doi.org/10.1007/978-3-658-24764-5
ISBN:	9783658247645

The Language of Self-Avoiding Walks = Connective Constants of Quasi-Transitive Graphs /
Lindorfer, Christian.

The Language of Self-Avoiding WalksConnective Constants of Quasi-Transitive Graphs /[electronic resource] :by Christian Lindorfer. - 1st ed. 2018. - XI, 65 p. 1 illus.online resource. - BestMasters,2625-3577. - BestMasters,.

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.

ISBN: 9783658247645

Standard No.: 10.1007/978-3-658-24764-5doiSubjects--Topical Terms:

579870
Algebra.

LC Class. No.: QA150-272

Dewey Class. No.: 512

The Language of Self-Avoiding Walks = Connective Constants of Quasi-Transitive Graphs /
LDR:02569nam a22003975i 4500 001 986906
003 DE-He213
005 20200702202310.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783658247645 $9 978-3-658-24764-5
024 7 $a 10.1007/978-3-658-24764-5 $2 doi
035 $a 978-3-658-24764-5
050 4 $a QA150-272
072 7 $a PBF $2 bicssc
072 7 $a MAT002000 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 512 $2 23
100 1 $a Lindorfer, Christian. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1211800
245 1 4 $a The Language of Self-Avoiding Walks $h [electronic resource] : $b Connective Constants of Quasi-Transitive Graphs / $c by Christian Lindorfer.
250 $a 1st ed. 2018.
264 1 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Spektrum, $c 2018.
300 $a XI, 65 p. 1 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a BestMasters, $x 2625-3577
505 0 $a 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.
520 $a 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.
650 0 $a Algebra. $2 gtt $3 579870
650 0 $a Computer mathematics. $3 1199796
650 0 $a Geometry. $3 579899
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 669338
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783658247638
776 0 8 $i Printed edition: $z 9783658247652
830 0 $a BestMasters, $x 2625-3577 $3 1253531
856 4 0 $u https://doi.org/10.1007/978-3-658-24764-5
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)