<P>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.</P>
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Gastos de envío:
GRATIS
A Estados Unidos de America
Librería: booksXpress, Bayonne, NJ, Estados Unidos de America
Soft Cover. Condición: new. Nº de ref. del artículo: 9783658247638
Cantidad disponible: 10 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020250255
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9783658247638_lsuk
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783658247638
Cantidad disponible: 10 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 80 pp. Englisch. Nº de ref. del artículo: 9783658247638
Cantidad disponible: 2 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 80 pages. 8.26x5.82x0.98 inches. In Stock. Nº de ref. del artículo: x-3658247630
Cantidad disponible: 2 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783658247638
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Publication in the field of mathematicsGraph 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. Nº de ref. del artículo: 256051508
Cantidad disponible: Más de 20 disponibles