Efficient Simulation of Markov Chains Using Segmentation

A methodology is proposed that is suitable for efficient simulation of continuous-time Markov chains that are nearly-completely decomposable. For such Markov chains the effort to adequately explore the state space via Crude Monte Carlo (CMC) simulation can be extremely large. The purpose of this paper is to provide a fast alternative to the standard CMC algorithm, which we call Aggregate Monte Carlo (AMC). The idea of the AMC algorithm is to reduce the jumping back and forth of the Markov chain in small subregions of the state space. We accomplish this by aggregating such problem regions into single states. We discuss two methods to identify collections of states where the Markov chain may become ‘trapped’: the stochastic watershed segmentation from image analysis, and a graph-theoretic decomposition method. As a motivating application, we consider the problem of estimating the charge carrier mobility of disordered organic semiconductors, which contain low-energy regions in which the charge carrier can quickly become stuck. It is shown that the AMC estimator for the charge carrier mobility reduces computational costs by several orders of magnitude compared to the CMC estimator.

[1]  Bernard W. Silverman,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[2]  John N. Tsitsiklis,et al.  Statistical Multiplexing of Multiple Time-Scale Markov Streams , 1995, IEEE J. Sel. Areas Commun..

[3]  Herbert A. Simon,et al.  Aggregation of Variables in Dynamic Systems , 1961 .

[4]  M. Silver,et al.  Dispersive hopping transport via sites having a Gaussian distribution of energies , 1981 .

[5]  Alexander Lukyanov,et al.  Microscopic Simulations of Charge Transport in Disordered Organic Semiconductors , 2011, Journal of chemical theory and computation.

[6]  Andres M. Somoza,et al.  Monte Carlo method for relaxation in electron glasses , 2005 .

[7]  Dominique Jeulin,et al.  Stochastic watershed segmentation , 2007, ISMM.

[8]  A. P. J Jansen,et al.  An Introduction to Kinetic Monte Carlo Simulations of Surface Reactions , 2012 .

[9]  C. D. Kemp,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[10]  Denis Andrienko,et al.  Challenges for in silico design of organic semiconductors , 2012 .

[11]  R. Coehoorn,et al.  Monte Carlo study of charge transport in organic sandwich-type single-carrier devices: Effects of Coulomb interactions , 2011 .

[12]  Martin Neukom,et al.  Monte-Carlo Simulation of Charge Transport in Disordered Organic Photoconductors , 2011 .

[13]  H. Bässler Charge Transport in Disordered Organic Photoconductors a Monte Carlo Simulation Study , 1993 .

[14]  P. Blom,et al.  Unified description of charge-carrier mobilities in disordered semiconducting polymers. , 2005, Physical review letters.

[15]  D. Szyld,et al.  Application of threshold partitioning of sparse matrices to Markov chains , 1996, Proceedings of IEEE International Computer Performance and Dependability Symposium.

[16]  Noam Rappaport,et al.  Charge Transport in Disordered Organic Materials and Its Relevance to Thin‐Film Devices: A Tutorial Review , 2009 .

[17]  F. Kelly,et al.  Stochastic networks : theory and applications , 1996 .

[18]  S. Beucher Use of watersheds in contour detection , 1979 .

[19]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[20]  Volker Schmidt,et al.  Efficient simulation of charge transport in deep-trap media , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[21]  R. Redmer,et al.  Electronic transport coefficients from ab initio simulations and application to dense liquid hydrogen , 2011, 1205.0429.

[22]  M Faessel,et al.  Segmentation of 3D microtomographic images of granular materials with the stochastic watershed , 2010, Journal of microscopy.