SearcharxivSearch

arXiv · 2405.15836

A Graph Random Walk Method for Calculating Time-of-Flight Charge Mobility in Organic Semiconductors from Multiscale Simulations

Abstract

We present a graph random walk (GRW) method for the study of charge transport properties of complex molecular materials in the time-of-flight regime. The molecules forming the material are represented by the vertices of a directed weighted graph, and the charge carriers are random walkers. The edge weights are rates for elementary jumping processes for a charge carrier to move along the edge and are determined from a combination of the energies of the involved vertices and an interaction strength. Exclusions are built into the random walk to account for the Pauli exclusion principle. In time-of-flight experiments, charge carriers are injected into the material and the time until they reach a collecting electrode is recorded. Our approach allows direct evaluation of the expected hitting time of the collecting nodes in terms of a sparse, linear system, avoiding numerically cumbersome and potentially fluctuations-prone methods based on explicit time evolution from solutions of a high-dimensional Master Equation or from kinetic Monte Carlo (KMC). We validate the GRW approach by numerical studies of charge dynamics of single and multiple carriers in diffusive and drift-diffusive regimes using a surrogate lattice model of a realistic material whose properties have been simulated within a multiscale model framework combining quantum-mechanical and molecular-mechanics methods. The surrogate model allows varying types and strengths of energetic disorder from the reference baseline. Comparison with results from the Master Equation confirms the theoretical equivalence of both approaches also in numerical implementations. We further show that KMC results show substantial deviations due to inadequate sampling. All in all, we find that the GRW method provides a powerful alternative to the more commonly used methods without sampling issues and with the benefit of making use of sparse matrix methods.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhongquan Chen, Pim van der Hoorn, Björn Baumeier. 2024-05-24. A Graph Random Walk Method for Calculating Time-of-Flight Charge Mobility in Organic Semiconductors from Multiscale Simulations. https://arxiv.org/abs/2405.15836

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech