CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt170",{id:"formSmash:upper:j_idt170",widgetVar:"widget_formSmash_upper_j_idt170",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt178_j_idt181",{id:"formSmash:upper:j_idt178:j_idt181",widgetVar:"widget_formSmash_upper_j_idt178_j_idt181",target:"formSmash:upper:j_idt178:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Connectivity Properties of Archimedean and Laves LatticesPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2004 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Uppsala: Matematiska institutionen , 2004. , p. 37
##### Series

Uppsala Dissertations in Mathematics, ISSN 1401-2049 ; 34
##### Keywords [en]

Mathematical statistics, percolation, self-avoiding walks, Archimedean and Laves lattices
##### Keywords [sv]

Matematisk statistik
##### National Category

Probability Theory and Statistics
##### Identifiers

URN: urn:nbn:se:uu:diva-4251ISBN: 91-506-1751-6 (print)OAI: oai:DiVA.org:uu-4251DiVA, id: diva2:164546
##### Public defence

2004-06-04, Room 2347, Polacksbacken, Uppsala, 13:15
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt825",{id:"formSmash:j_idt825",widgetVar:"widget_formSmash_j_idt825",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt837",{id:"formSmash:j_idt837",widgetVar:"widget_formSmash_j_idt837",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt852",{id:"formSmash:j_idt852",widgetVar:"widget_formSmash_j_idt852",multiple:true}); Available from: 2004-05-14 Created: 2004-05-14Bibliographically approved
##### List of papers

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.

1. Inclusions and Non-Inclusions of Archimedean and Laves Lattices$(function(){PrimeFaces.cw("OverlayPanel","overlay164540",{id:"formSmash:j_idt1002:0:j_idt1010",widgetVar:"overlay164540",target:"formSmash:j_idt1002:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Ordering Bond Percolation Critical Probabilities$(function(){PrimeFaces.cw("OverlayPanel","overlay164541",{id:"formSmash:j_idt1002:1:j_idt1010",widgetVar:"overlay164541",target:"formSmash:j_idt1002:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. Bounds for the Connective Constant on the Hexagonal Lattice$(function(){PrimeFaces.cw("OverlayPanel","overlay164542",{id:"formSmash:j_idt1002:2:j_idt1010",widgetVar:"overlay164542",target:"formSmash:j_idt1002:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. Pairs of Graphs with Connective Constants and Critical Probabilities in the Same Order$(function(){PrimeFaces.cw("OverlayPanel","overlay164543",{id:"formSmash:j_idt1002:3:j_idt1010",widgetVar:"overlay164543",target:"formSmash:j_idt1002:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

5. Inclusions and Non-Inclusions of Matching Archimedean Lattices$(function(){PrimeFaces.cw("OverlayPanel","overlay164544",{id:"formSmash:j_idt1002:4:j_idt1010",widgetVar:"overlay164544",target:"formSmash:j_idt1002:4:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

6. Estimation of Bond Percolation Thresholds on the Archimedean Lattices$(function(){PrimeFaces.cw("OverlayPanel","overlay164545",{id:"formSmash:j_idt1002:5:j_idt1010",widgetVar:"overlay164545",target:"formSmash:j_idt1002:5:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1878",{id:"formSmash:j_idt1878",widgetVar:"widget_formSmash_j_idt1878",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1931",{id:"formSmash:lower:j_idt1931",widgetVar:"widget_formSmash_lower_j_idt1931",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1932_j_idt1934",{id:"formSmash:lower:j_idt1932:j_idt1934",widgetVar:"widget_formSmash_lower_j_idt1932_j_idt1934",target:"formSmash:lower:j_idt1932:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});