KINETIC NETWORKS AND ORDER-STATISTICS FOR HOPPING IN DISORDERED-SYSTEMS

A critical comparison between geometrical networks (based on some bond ing criterion) and kinetic networks (the actual path of the carrier) i s made for dispersive hopping in disordered systems. The method of ord er statistics is used for the characterization of the kinetic network. These statistics describe the distributions of first, second and high er transition rates out of a given site to other sites in a hopping co nfiguration and can adequately explain the structure of the kinetic ne twork for the strong disorder case, via consideration of chain growth versus branching. Using numerical simulation a detailed investigation of how the structure of the kinetic network changes with increasing di sorder is presented. When disorder is strong, the kinetic network beco mes predominantly one-dimensional and is actually a small subset of th e geometrical network. As one of the consequences, the kinetics due to capture at recombination centres slow down and become close to behavi our typical for one dimension.