Dynamical Vertex Approximation - An Introduction

被引:0
|
作者
Held, Karsten [1 ]
Katanin, Andrey A. [2 ,3 ]
Toschi, Alessandro [2 ]
机构
[1] Vienna Univ Technol, Inst Solid State Phys, A-1040 Vienna, Austria
[2] Max Planck Inst Festkorperforsch, D-70569 Stuttgart, Germany
[3] Inst Met Phys, Ekaterinburg 620219, Russia
关键词
D O I
暂无
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We give an elementary introduction to a recent diagrammatic extension of dynamical mean field theory (DMFT) coined dynamical vertex approximation (D Gamma A). This approach contains the important local correlations of DMFT, giving, among others, rise to quasiparticle renormalizations, Mott-Hubbard transitions and magnetism, but also non-local correlations beyond. The latter are at the very essence of many physical phenomena in strongly correlated elecectron systems. As correlations are treated equally on all length scales, D Gamma A allows us to describe physical phenomena such as magnons, quantum criticality, and the interplay between antiferromagnetism and superconductivity. We review results hitherto obtained for the Hubbard model in dimensions d = 3, 2, and 1.
引用
收藏
页码:117 / 133
页数:17
相关论文
共 50 条
  • [21] APPROXIMATION OF PARTIAL CAPACITATED VERTEX COVER
    Bar-Yehuda, Reuven
    Flysher, Guy
    Mestre, Julian
    Rawitz, Dror
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (04) : 1441 - 1469
  • [22] Improved approximation of maximum vertex cover
    Galluccio, A
    Nobili, P
    OPERATIONS RESEARCH LETTERS, 2006, 34 (01) : 77 - 84
  • [23] On approximation of max-vertex-cover
    Han, QM
    Ye, YY
    Zhang, HT
    Zhang, JW
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 143 (02) : 342 - 355
  • [24] An approximation of the minimum vertex cover in a graph
    Nagamochi, H
    Ibaraki, T
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 1999, 16 (03) : 369 - 375
  • [25] Approximation for vertex cover in β-conflict graphs
    Miao, Dongjing
    Cai, Zhipeng
    Tong, Weitian
    Li, Jianzhong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1052 - 1059
  • [26] Approximation of partial capacitated vertex cover
    Bar-Yehuda, Reuven
    Flysher, Guy
    Mestre, Julian
    Rawitz, Dror
    ALGORITHMS - ESA 2007, PROCEEDINGS, 2007, 4698 : 335 - +
  • [27] Approximation and Kernelization for Chordal Vertex Deletion
    Jansen, Bart M. P.
    Pilipczuk, Marcin
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1399 - 1418
  • [28] Private approximation of clustering and vertex cover
    Beimel, Amos
    Hallak, Renen
    Nissim, Kobbi
    THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2007, 4392 : 383 - +
  • [29] An approximation of the minimum vertex cover in a graph
    Hiroshi Nagamochi
    Toshihide Ibaraki
    Japan Journal of Industrial and Applied Mathematics, 1999, 16 : 369 - 375
  • [30] Private Approximation of Clustering and Vertex Cover
    Amos Beimel
    Renen Hallak
    Kobbi Nissim
    computational complexity, 2009, 18