Localized Phase for the Erdos-Renyi Graph

被引:2
|
作者
Alt, Johannes [1 ]
Ducatez, Raphael [2 ]
Knowles, Antti [3 ]
机构
[1] Univ Bonn, Inst Appl Math, Bonn, Germany
[2] Univ Lyon 1, Inst Camille Jordan, Villeurbanne, France
[3] Univ Geneva, Sect Math, Geneva, Switzerland
基金
欧洲研究理事会; 瑞士国家科学基金会; 美国国家科学基金会;
关键词
RANDOM BAND MATRICES; ABSOLUTELY CONTINUOUS-SPECTRUM; ALTSHULER-SHKLOVSKII FORMULAS; SCHRODINGER-OPERATORS; EXTREMAL EIGENVALUES; SCALING PROPERTIES; LARGE DISORDER; DELOCALIZATION; STATISTICS; DIFFUSION;
D O I
10.1007/s00220-023-04918-z
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We analyse the eigenvectors of the adjacency matrix of the Erdos-Renyi graph G(N,d/N) for root log N << d less than or similar to log N. We show the existence of a localized phase, where each eigenvector is exponentially localized around a single vertex of the graph. This complements the completely delocalized phase previously established in Alt et al. (Commun Math Phys 388(1):507-579, 2021). For large enough d, we establish a mobility edge by showing that the localized phase extends up to the boundary of the delocalized phase. We derive explicit asymptotics for the localization length up to the mobility edge and characterize its divergence near the phase boundary. The proof is based on a rigorous verification of Mott's criterion for localization, comparing the tunnelling amplitude between localization centres with the eigenvalue spacing. The first main ingredient is a new family of global approximate eigenvectors, for which sharp enough estimates on the tunnelling amplitude can be established. The second main ingredient is a lower bound on the spacing of approximate eigenvalues. It follows from an anticoncentration result for these discrete random variables, obtained by a recursive application of a self-improving anticoncentration estimate due to Kesten.
引用
收藏
页数:74
相关论文
共 50 条
  • [21] Large Deviations for Subcritical Bootstrap Percolation on the Erdos-Renyi Graph
    Angel, Omer
    Kolesnik, Brett
    JOURNAL OF STATISTICAL PHYSICS, 2021, 185 (02)
  • [22] The genus of the Erdos-Renyi random graph and the fragile genus property
    Dowden, Chris
    Kang, Mihyun
    Krivelevich, Michael
    RANDOM STRUCTURES & ALGORITHMS, 2020, 56 (01) : 97 - 121
  • [23] Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
    Cullina, Daniel
    Kiyavash, Negar
    SIGMETRICS/PERFORMANCE 2016: PROCEEDINGS OF THE SIGMETRICS/PERFORMANCE JOINT INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SCIENCE, 2016, : 63 - 72
  • [24] First-passage properties of the Erdos-Renyi random graph
    Sood, V
    Redner, S
    Ben-Avraham, D
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2005, 38 (01): : 109 - 123
  • [25] AN ERDOS-RENYI LAW WITH SHIFTS
    ARRATIA, R
    WATERMAN, MS
    ADVANCES IN MATHEMATICS, 1985, 55 (01) : 13 - 23
  • [26] Limiting shape of the depth first search tree in an Erdos-Renyi graph
    Enriquez, Nathanael
    Faraud, Gabriel
    Menard, Laurent
    RANDOM STRUCTURES & ALGORITHMS, 2020, 56 (02) : 501 - 516
  • [27] Approximating the Cumulant Generating Function of Triangles in the Erdos-Renyi Random Graph
    Giardina, Cristian
    Giberti, Claudio
    Magnanini, Elena
    JOURNAL OF STATISTICAL PHYSICS, 2021, 182 (02)
  • [28] Convergence towards an Erdos-Renyi graph structure in network contraction processes
    Tishby, Ido
    Biham, Ofer
    Katzav, Eytan
    PHYSICAL REVIEW E, 2019, 100 (03)
  • [29] ON GENERAL VERSIONS OF ERDOS-RENYI LAWS
    STEINEBACH, J
    ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1981, 56 (04): : 549 - 554
  • [30] COMPONENT SIZES FOR LARGE QUANTUM ERDOS-RENYI GRAPH NEAR CRITICALITY
    Dembo, Amir
    Levit, Anna
    Vadlamani, Sreekar
    ANNALS OF PROBABILITY, 2019, 47 (02): : 1185 - 1219