Quantum transport in graphene nanoribbon networks: complexity reduction by a network decimation algorithm
DOI10.1088/1367-2630/ACAEF0zbMATH Open1510.82055arXiv2212.07238OpenAlexW4313418292MaRDI QIDQ6042384FDOQ6042384
Authors: Martina Hentschel, Jörg Schuster
Publication date: 10 May 2023
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.07238
Recommendations
- Electronic transport through superlattice-graphene nanoribbons
- Direct simulation of charge transport in graphene nanoribbons
- Electronic states in ordered and disordered quantum networks: With applications to graphene and to boron nanotubes
- Efficient linear-scaling quantum transport calculations on graphics processing units and applications on electron transport in graphene
- Electron quantum transport in disordered graphene
networkquantum transportnodal analysisgraphene nanoribbondecimation schemedensity-functional-based tight bindingrecursive Green's function formalism
Transport processes in time-dependent statistical mechanics (82C70) Statistical mechanics of nanostructures and nanoparticles (82D80)
Cites Work
Cited In (3)
- Efficient linear-scaling quantum transport calculations on graphics processing units and applications on electron transport in graphene
- Electronic transport through superlattice-graphene nanoribbons
- Electronic states in ordered and disordered quantum networks: With applications to graphene and to boron nanotubes
This page was built for publication: Quantum transport in graphene nanoribbon networks: complexity reduction by a network decimation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042384)