Parallel computing for mobilities in periodic geometries

We examine methods for calculating the effective mobilities of molecules driven through periodic geometries in the context of particle-based simulation. The standard formulation of the mobility, based on the long-time limit of the mean drift velocity, is compared to a formulation based on the mean first-passage time of molecules crossing a single period of the system geometry. The equivalence of the two definitions is derived under weaker assumptions than similar conclusions obtained previously, requiring only that the state of the system at subsequent period crossings satisfy the Markov property. Approximate theoretical analyses of the computational costs of estimating these two mobility formulations via particle simulations suggest that the definition based on first-passage times may be substantially better suited to exploiting parallel computation hardware. This claim is investigated numerically on an example system modeling the passage of nanoparticles through the slit-well device. In this case, the traditional mobility formulation is found to perform best when the Péclet number is small, whereas the mean first-passage time formulation is found to converge much more quickly when the Péclet number is moderate or large. The results suggest that, given relatively modest access to modern GPU hardware, this alternative mobility formulation may be an order of magnitude faster than the standard technique for computing effective mobilities of biomolecules through periodic geometries.