arXiv · 0903.0438
Percolation Thresholds of the Fortuin-Kasteleyn Cluster for the Edwards-Anderson Ising Model on Complex Networks
Abstract
We analytically show the percolation thresholds of the Fortuin-Kasteleyn cluster for the Edwards-Anderson Ising model on random graphs with arbitrary degree distributions. The results on the Nishimori line are shown. We obtain the results for the +-J model, the diluted +-J model, and the Gaussian model, by applying an extension of a criterion for the random graphs with arbitrary degree distributions. The results for the infinite-range $\pm J$ model and the Sherrington-Kirkpatrick model are also shown.
Explore related subjects
Keep this discovery
Chiaki Yamaguchi. 2010-10-03. Percolation Thresholds of the Fortuin-Kasteleyn Cluster for the Edwards-Anderson Ising Model on Complex Networks. https://doi.org/10.1143/ptp.124.399
Cite the original work for its findings. Save a collection to share your selection of sources.