國立虎尾科技大學 |

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.
出版者:	Wiesbaden :Springer Fachmedien Wiesbaden : : 2018.,
面頁冊數:	xi, 65 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
標題:	Graph theory. -
電子資源:	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. - Wiesbaden :Springer Fachmedien Wiesbaden :2018. - xi, 65 p. :ill., digital ;24 cm. - 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:

527884
Graph theory.

LC Class. No.: QA166

Dewey Class. No.: 511.5

The language of self-avoiding walks = connective constants of quasi-transitive graphs /
LDR:02227nam a2200337 a 4500 001 930556
003 DE-He213
005 20190510144513.0
006 m d
007 cr nn 008maaau
008 190627s2018 gw s 0 eng d
020 $a 9783658247645 $q (electronic bk.)
020 $a 9783658247638 $q (paper)
024 7 $a 10.1007/978-3-658-24764-5 $2 doi
035 $a 978-3-658-24764-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166
072 7 $a PBF $2 bicssc
072 7 $a MAT002000 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .L747 2018
100 1 $a Lindorfer, Christian. $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.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Spektrum, $c 2018.
300 $a xi, 65 p. : $b ill., digital ; $c 24 cm.
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 Graph theory. $3 527884
650 0 $a Random walks (Mathematics) $3 783164
650 1 4 $a Algebra. $2 gtt $3 579870
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 2 4 $a Geometry. $3 579899
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a BestMasters. $3 1021672
856 4 0 $u https://doi.org/10.1007/978-3-658-24764-5
950 $a Mathematics and Statistics (Springer-11649)