✦ LIBER ✦

Ising Critical Exponents on Random Trees and Graphs

✍ Scribed by Dommers, Sander; Giardinà, Cristian; van der Hofstad, Remco

Book ID: 125342230
Publisher: Springer
Year: 2014
Tongue: English
Weight: 460 KB
Volume: 328
Category: Article
ISSN: 0010-3616
DOI: 10.1007/s00220-014-1992-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Critical exponents of four-dimensional r

Critical exponents of four-dimensional random-field Ising systems

✍ Hartmann, Alexander K. 📂 Article 📅 2002 🏛 The American Physical Society 🌐 English ⚖ 129 KB

Critical exponents of random Ising-like

Critical exponents of random Ising-like systems in general dimensions

✍ Yu. Holovatch; M. Shpot 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 737 KB

Critical exponents of the three-dimensio

Critical exponents of the three-dimensional random field Ising model

✍ Rieger, H; Young, A P 📂 Article 📅 1993 🏛 Institute of Physics 🌐 English ⚖ 321 KB

Random trees and random graphs

✍ Tomasz Łuczak 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB 👁 2 views

In the paper we study the asymptotic behavior of the number of trees with n Ž . Ž . vertices and diameter k s k n , where n y k rnª a as n ª ϱ for some constant a-1. We use this result to determine the limit distribution of the diameter of the random graph Ž .

Ising Models on Power-Law Random Graphs

✍ Sander Dommers; Cristian Giardinà; Remco van der Hofstad 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 574 KB

On-Line Coloring of Sparse Random Graphs

On-Line Coloring of Sparse Random Graphs and Random Trees

✍ Boris Pittel; Robert S. Weishaar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 164 KB

The performance of the greedy coloring algorithm ''first fit'' on sparse random graphs G and on random trees is investigated. In each case, approximately n, c r n log log n colors are used, the exact number being concentrated almost surely on at 2 most two consecutive integers for a sparse random gr