Bounds of percolation thresholds in the enhanced binary tree

Seung Ki Baek and Petter Minnhagen

Physica A: Statistical Mechanics and its Applications, 2011, vol. 390, issue 8, 1447-1452

Abstract: By studying its subgraphs, it is argued that the lower critical percolation threshold of the enhanced binary tree (EBT) is bounded as pc1<0.355059, while the upper threshold is bounded both from above and below by 1/2 according to renormalization-group arguments. We also review a correlation analysis in an earlier work, which claimed a significantly higher estimate of pc2 than 1/2, to show that this analysis in fact gives a consistent result with this bound. Our result confirms that the duality relation between critical thresholds does not hold exactly for the EBT and its dual, possibly due to the lack of transitivity.

Keywords: Percolation threshold; Enhanced binary tree; Hyperbolic lattice (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437111000094
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:390:y:2011:i:8:p:1447-1452

DOI: 10.1016/j.physa.2010.12.030

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().