Full counting statistics of random transition-rate matrices
arXiv:1310.4070 · doi:10.1103/PhysRevE.88.062148
Abstract
We study the full counting statistics of current of large open systems through the application of random matrix theory to transition-rate matrices. We develop a method for calculating the ensemble-averaged current-cumulant generating functions based on an expansion in terms of the inverse system size. We investigate how different symmetry properties and different counting schemes affect the results.
References in corpus (24)
- Random-Matrix Theory of Quantum Transport
- Random Matrix Theories in Quantum Physics: Common Concepts
- Electron Counting Statistics and Coherent States of Electric Current
- Counting statistics of single-electron transport in a quantum dot
- Full Counting Statistics of Charge Transfer in Coulomb Blockade Systems
- Microscopic derivation of rate equations for quantum transport
- Universal oscillations in counting statistics
- Counting Statistics of Non-Markovian Quantum Stochastic Processes
- Rate equations for quantum transport in multi-dot systems
- Counting statistics of transport through Coulomb blockade nanostructures: High-order cumulants and non-Markovian effects
- Conditional statistics of electron transport in interacting nanoscale conductors
- Anomalous Transport in Complex Networks
- Frequency-dependent counting statistics in interacting nanoscale conductors
- Measurements of higher order noise correlations in a quantum dot with a finite bandwidth detector
- Relaxation Properties of Small-World Networks
- Scaling Properties of Random Walks on Small-World Networks
- A mean-field model for the electron glass dynamics
- Finite-frequency counting statistics of electron transport: Markovian Theory
- Bunching and anti-bunching in electronic transport
- Random transition-rate matrices for the master equation
- Counting statistics of cotunneling electrons
- On random symmetric matrices with a constraint: the spectral density of random impedance networks
- Spectral Properties of Random Reactance Networks and Random Matrix Pencils
- Random Walks on Complex Networks