activity
20032023
most citedQuantum critical transport in clean graphene

336 citations · 2.9k across the 75 of their papers we have counts for

collaborators

75 papers

cond-mat.str-el2023★ 6 cited

Hydrodynamic electronic transport

Lars Fritz, Thomas Scaffidi

The ``flow'' of electric currents and heat in standard metals is diffusive with electronic motion randomized by impurities. However, for ultraclean metals, electrons can flow like…

cond-mat.str-el2023★ 17 cited

Kondo effect in twisted bilayer graphene

A. S. Shankar, D. O. Oriekhov, Andrew K. Mitchell +1

The emergence of flat bands in twisted bilayer graphene at the magic angle can be understood in terms of a vanishing Fermi velocity of the Dirac cone. This is associated with van H…

cond-mat.str-el2023★ 1 cited

Lyapunov exponents in a Sachdev-Ye-Kitaev-type model with population imbalance in the conformal limit and beyond

A. S. Shankar, M. Fremling, S. Plugge +1

The Sachdev-Ye-Kitaev (SYK) model shows chaotic behavior with a maximal Lyapunov exponent. In this paper, we investigate the four-point function of a SYK-type model numerically, wh…

cond-mat.str-el2022★ 5 cited

Hydrodynamics of charged two-dimensional Dirac systems II: the role of collective modes

Kitinan Pongsangangan, T. Ludwig, H. T. C. Stoof +1

We study the hydrodynamic properties of ultraclean interacting two-dimensional Dirac electrons with Keldysh quantum field theory. We study it from a weak-coupling and a strong-coup…

cond-mat.str-el2022★ 22 cited

Hydrodynamics of charged two-dimensional Dirac systems I: thermo-electric transport

Kitinan Pongsangangan, T. Ludwig, H. T. C. Stoof +1

In this paper we study thermo-electric transport in interacting two-dimensional Dirac-type systems using a phenomenological Boltzmann approach. We consider a setup that can accommo…

math.CO2021★ 18 cited

Lower bounds for Ramsey numbers as a statistical physics problem

Jurriaan Wouters, Aris Giotis, Ross Kang +2

Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In…