Journal article
A random hierarchical lattice: The series-parallel graph and its properties
- 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 finda phase transition at p = 1/2. © Applied Probability Trust 2004.
- Publication status:
- Published
Actions
Authors
- Journal:
- ADVANCES IN APPLIED PROBABILITY More from this journal
- Volume:
- 36
- Issue:
- 3
- Pages:
- 824-838
- Publication date:
- 2004-09-01
- DOI:
- ISSN:
-
0001-8678
- Keywords:
- Pubs id:
-
pubs:10397
- UUID:
-
uuid:fd21bacf-d2a5-4ff1-b130-e303bf008494
- Local pid:
-
pubs:10397
- Source identifiers:
-
10397
- Deposit date:
-
2012-12-19
Terms of use
- Copyright date:
- 2004
If you are the owner of this record, you can report an update to it here: Report update to this record