DENSITY OF STATES OF A SPARSE RANDOM MATRIX

被引：135
|
作者：
RODGERS, GJ [1 ]
BRAY, AJ [1 ]
机构：
[1] SCHLUMBERGER DOLL RES,RIDGEFIELD,CT 06877
来源：
PHYSICAL REVIEW B | 1988年 / 37卷 / 07期
关键词：
D O I：
10.1103/PhysRevB.37.3557
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
引用
收藏
页码：3557 / 3562
页数：6
相关论文
共 50 条
  • [21] Geometry of density matrix states
    Boya, Luis J.
    Dixit, Kuldeep
    PHYSICAL REVIEW A, 2008, 78 (04):
  • [22] SPARSE REGULAR RANDOM GRAPHS: SPECTRAL DENSITY AND EIGENVECTORS
    Dumitriu, Ioana
    Pal, Soumik
    ANNALS OF PROBABILITY, 2012, 40 (05): : 2197 - 2235
  • [23] Typicality in random matrix product states
    Garnerone, Silvano
    de Oliveira, Thiago R.
    Zanardi, Paolo
    PHYSICAL REVIEW A, 2010, 81 (03):
  • [24] Magic of random matrix product states
    Chen, Liyuan
    Garcia, Roy J.
    Bu, Kaifeng
    Jaffe, Arthur
    PHYSICAL REVIEW B, 2024, 109 (17)
  • [25] ON THE STATISTICAL-MECHANICS APPROACH IN THE RANDOM-MATRIX THEORY - INTEGRATED DENSITY-OF-STATES
    DEMONVEL, AB
    PASTUR, L
    SHCHERBINA, M
    JOURNAL OF STATISTICAL PHYSICS, 1995, 79 (3-4) : 585 - 611
  • [26] Density of States for Random Band Matrices
    M. Disertori
    H. Pinson
    T. Spencer
    Communications in Mathematical Physics, 2002, 232 : 83 - 124
  • [27] Density of states for random band matrices
    Disertori, M
    Pinson, H
    Spencer, T
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2002, 232 (01) : 83 - 124
  • [28] Sparse approximate matrix-matrix multiplication for density matrix purification with error control
    Artemov, Anton G.
    Rubensson, Emanuel H.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2021, 438
  • [29] Reconstruction algorithm of sparse check matrix based on random extraction
    Liu H.
    Zhang L.
    Yan W.
    Tan K.
    Zhang Y.
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2023, 45 (04): : 1215 - 1221
  • [30] A compact sparse matrix representation using random hash functions
    Jiang, JH
    Chang, CC
    Chen, TS
    DATA & KNOWLEDGE ENGINEERING, 2000, 32 (01) : 29 - 49
12345