A random hierarchical lattice: the series-parallel graph and its properties
2004 ◽
Vol 36
(03)
◽
pp. 824-838
◽
Keyword(s):
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
2004 ◽
Vol 36
(3)
◽
pp. 824-838
◽
Keyword(s):
2010 ◽
Vol 20
(5)
◽
pp. 1907-1965
◽
2015 ◽
Vol DMTCS Proceedings, 27th...
(Proceedings)
◽
2021 ◽
pp. 1-17
Keyword(s):
Keyword(s):
2014 ◽
Vol 51
(A)
◽
pp. 101-121
◽
2008 ◽
Vol 49
(12)
◽
pp. 125218
◽