Single and multiple random walks on random lattices: Excitation trapping and annihilation simulations
dc.contributor.author | Argyrakis, Panos | en_US |
dc.contributor.author | Hoshen, Joseph | en_US |
dc.contributor.author | Kopelman, Raoul | en_US |
dc.contributor.author | Newhouse, James S. | en_US |
dc.date.accessioned | 2006-09-11T15:43:24Z | |
dc.date.available | 2006-09-11T15:43:24Z | |
dc.date.issued | 1983-02 | en_US |
dc.identifier.citation | Kopelman, R.; Hoshen, J.; Newhouse, J. S.; Argyrakis, P.; (1983). "Single and multiple random walks on random lattices: Excitation trapping and annihilation simulations." Journal of Statistical Physics 30(2): 335-343. <http://hdl.handle.net/2027.42/45145> | en_US |
dc.identifier.issn | 0022-4715 | en_US |
dc.identifier.issn | 1572-9613 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45145 | |
dc.description.abstract | Random walk simulations of exciton trapping and annihilation on binary and ternary lattices are presented. Single walker visitation efficiencies for ordered and random binary lattices are compared. Interacting multiple random walkers on binary and ternary random lattices are presented in terms of trapping and annihilation efficiencies that are related to experimental observables. A master equation approach, based on Monte Carlo cluster distributions, results in a nonclassical power relationship between the exciton annihilation rate and the exciton density. | en_US |
dc.format.extent | 386744 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers-Plenum Publishers; Plenum Publishing Corporation ; Springer Science+Business Media | en_US |
dc.subject.other | Annihilation | en_US |
dc.subject.other | Trapping | en_US |
dc.subject.other | Random Walk | en_US |
dc.subject.other | Physics | en_US |
dc.subject.other | Quantum Physics | en_US |
dc.subject.other | Physical Chemistry | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.subject.other | Statistical Physics | en_US |
dc.subject.other | Exciton | en_US |
dc.subject.other | Fusion | en_US |
dc.subject.other | Diffusion | en_US |
dc.subject.other | Energy Transfer | en_US |
dc.subject.other | Master Equation | en_US |
dc.title | Single and multiple random walks on random lattices: Excitation trapping and annihilation simulations | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Physics | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Chemistry, University of Michigan, 48109, Ann Arbor, Michigan | en_US |
dc.contributor.affiliationum | Department of Chemistry, University of Michigan, 48109, Ann Arbor, Michigan | en_US |
dc.contributor.affiliationum | Department of Chemistry, University of Michigan, 48109, Ann Arbor, Michigan | en_US |
dc.contributor.affiliationum | Department of Physics, University of Crete, Iraklion, Crete, Greece; Department of Chemistry, University of Michigan, 48109, Ann Arbor, Michigan | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45145/1/10955_2005_Article_BF01012307.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01012307 | en_US |
dc.identifier.source | Journal of Statistical Physics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.