Article,

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

, and .
Advances in Applied Probability, 36 (3): 824--838 (September 2004)
DOI: 10.1239/aap/1093962236

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 and 1−p respectively. 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 p = 2 1 .

Tags

Users

  • @peter.ralph

Comments and Reviews