Trapping of continuous-time quantum walks on Erdös–Rényi graphs
✍ Scribed by E. Agliari
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 376 KB
- Volume
- 390
- Category
- Article
- ISSN
- 0378-4371
No coin nor oath required. For personal study only.
✦ Synopsis
We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erdös-Rény graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of dilution, the survival probability typically decays exponentially with a (average) decay rate which depends non-monotonically on the graph connectivity; when the degree of dilution is either very low or very high, stationary states, not affected by traps, get more likely giving rise to a survival probability decaying to a finite value. Both these features constitute a qualitative difference with respect to the behavior found for classical walks.
📜 SIMILAR VOLUMES
## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that