Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-12T18:04:14.903Z Has data issue: false hasContentIssue false

A random hierarchical lattice: the series-parallel graph and its properties

Published online by Cambridge University Press:  01 July 2016

B. M. Hambly*
Affiliation:
University of Oxford
Jonathan Jordan*
Affiliation:
University of Sheffield
*
∗ Postal address: Mathematical Institute, University of Oxford, 24-29 St Giles, Oxford OX1 3LB, UK.
∗∗ Postal address: Department of Probability and Statistics, University of Sheffield, Hicks Building, Sheffield S3 7RH, UK. Email address: jonathan.jordan@sheffield.ac.uk

Abstract

We consider a sequence of random graphs constructed by a hierarchical procedure. The construction replaces existing edges by pairs of edges in series or parallel with probability p. We investigate the effective resistance across the graphs, first-passage percolation on the graphs and the Cheeger constants of the graphs as the number of edges tends to infinity. In each case we find a phase transition at

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2004 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable