Critical behavior at the localization transition on random regular graphs

被引:54
|
作者
Tikhonov, K. S. [1 ,2 ,3 ]
Mirlin, A. D. [1 ,3 ,4 ,5 ]
机构
[1] Karlsruhe Inst Technol, Inst Nanotechnol, D-76021 Karlsruhe, Germany
[2] Natl Res Univ Higher Sch Econ, Condensed Matter Phys Lab, Moscow 101000, Russia
[3] LD Landau Inst Theoret Phys RAS, Moscow 119334, Russia
[4] Karlsruhe Inst Technol, Inst Theorie Kondensierten Materie, D-76128 Karlsruhe, Germany
[5] Petersburg Nucl Phys Inst, St Petersburg 188300, Russia
关键词
METAL-INSULATOR-TRANSITION; MANY-BODY LOCALIZATION; BETHE LATTICE; ANDERSON LOCALIZATION; LEVEL STATISTICS; MODEL; SYSTEM; SYMMETRY; DENSITY; SHAPE;
D O I
10.1103/PhysRevB.99.214202
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We study numerically the critical behavior at the localization transition in the Anderson model on infinite Bethe lattice and on random regular graphs. The focus is on the case of coordination number m + 1 = 3, with a box distribution of disorder and in the middle of the band (energy E = 0), which is the model most frequently considered in the literature. As a first step, we carry out an accurate determination of the critical disorder, with the result W-C = 18.17 +/- 0.01. After this, we determine the dependence of the correlation volume N-xi = m(xi) (where xi is the associated correlation length) on disorder W on the delocalized side of the transition W < W-C, by means of population dynamics. The asymptotic critical behavior is found to be xi proportional to (W-C - W)(-1/2), in agreement with analytical prediction. We find very pronounced corrections to scaling, in similarity with models in high spatial dimensionality and with many-body localization transitions.
引用
收藏
页数:10
相关论文
共 50 条
  • [41] THE NUMBER OF MATCHINGS IN RANDOM REGULAR GRAPHS AND BIPARTITE GRAPHS
    BOLLOBAS, B
    MCKAY, BD
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 41 (01) : 80 - 91
  • [42] Distribution of subgraphs of random regular graphs
    Gao, Zhicheng
    Wormald, N. C.
    RANDOM STRUCTURES & ALGORITHMS, 2008, 32 (01) : 38 - 48
  • [43] Random walks on regular and irregular graphs
    Coppersmith, D
    Feige, U
    Shearer, J
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (02) : 301 - 308
  • [44] UNIFORM GENERATION OF RANDOM REGULAR GRAPHS
    Gao, Pu
    Wormald, Nicholas
    SIAM JOURNAL ON COMPUTING, 2017, 46 (04) : 1395 - 1427
  • [45] The spectral gap of random regular graphs
    Sarid, Amir
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (02) : 557 - 587
  • [46] HAMILTONIAN CYCLES IN RANDOM REGULAR GRAPHS
    FENNER, TI
    FRIEZE, AM
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (02) : 103 - 112
  • [47] Decycling numbers of random regular graphs
    Bau, S
    Wormald, NC
    Zhou, SM
    RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 397 - 413
  • [48] The Diameter of Dense Random Regular Graphs
    Shimizu, Nobutaka
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1934 - 1944
  • [49] Random Cluster Model on Regular Graphs
    Bencs, Ferenc
    Borbenyi, Marton
    Csikvari, Peter
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2023, 399 (01) : 203 - 248
  • [50] The cover time of random regular graphs
    Cooper, C
    Frieze, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) : 728 - 740