uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Pairs of Graphs with Connective Constants and Critical Probabilities in the Same Order
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics.
Article in journal (Refereed) Submitted
URN: urn:nbn:se:uu:diva-91717OAI: oai:DiVA.org:uu-91717DiVA: diva2:164543
Available from: 2004-05-14 Created: 2004-05-14Bibliographically approved
In thesis
1. Connectivity Properties of Archimedean and Laves Lattices
Open this publication in new window or tab >>Connectivity Properties of Archimedean and Laves Lattices
2004 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

An Archimedean lattice is a graph of a regular tiling of the plane, such that all corners are equivalent. A tiling is regular if all tiles are regular polygons: equilateral triangles, squares, et cetera. There exist exactly 11 Archimedean lattices. Being planar graphs, the Archimedean lattices have duals, 3 of which are Archimedean, the other 8 are called Laves lattices.

In the thesis, three measures of connectivity of these 19 graphs are studied: the connective constant for self-avoiding walks, and bond and site percolation critical probabilities. The connective constant measures connectivity by the number of walks in which all visited vertices are unique. The critical probabilities quantify the proportion of edges or vertices that can be removed, so that the produced subgraph has a large connected component.

A common issue for these measures is that they, although intensely studied by both mathematicians and scientists from other fields, have been calculated only for very few graphs. With the goal of comparing the induced orders of the Archimedean and Laves lattices under the three measures, the thesis gives improved bounds and estimates for many graphs.

A large part of the thesis focuses on the problem of deciding whether a given graph is a subgraph of another graph. This, surprisingly difficult problem, is considered for the set of Archimedean and Laves lattices, and for the set of matching Archimedean and Laves lattices.

Place, publisher, year, edition, pages
Uppsala: Matematiska institutionen, 2004. 37 p.
Uppsala Dissertations in Mathematics, ISSN 1401-2049 ; 34
Mathematical statistics, percolation, self-avoiding walks, Archimedean and Laves lattices, Matematisk statistik
National Category
Probability Theory and Statistics
urn:nbn:se:uu:diva-4251 (URN)91-506-1751-6 (ISBN)
Public defence
2004-06-04, Room 2347, Polacksbacken, Uppsala, 13:15
Available from: 2004-05-14 Created: 2004-05-14Bibliographically approved

Open Access in DiVA

No full text

By organisation
Department of Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 42 hits
ReferencesLink to record
Permanent link

Direct link