Efficient Simulation of Markov Chains Using Segmentation
- 361 Downloads
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.
KeywordsMarkov chain Nearly-completely decomposable Monte Carlo Segmentation Watershed Graph-theoretic decomposition Electron transport Mobility Organic semiconductor
AMS 2000 Subject Classification60J22
Unable to display preview. Download preview PDF.
- Angulo J, Jeulin D (2007) Stochastic watershed segmentation. In: Proceedings of the 8th international symposium on mathematical morphology, pp 265–276Google Scholar
- Beucher S, Lantuéjoul C (1979) Use of watersheds in contour detection. In: Proceedings of the international workshop on image processing, real-time edge and motion detection/estimation, pp 2.1–2.12Google Scholar
- Beucher S, Meyer F (1993) The morphological approach to segmentation: the watershed transformation. In: Mathematical morphology in image processing, vol 34, pp 433–481Google Scholar
- Brereton T, Stenzel O, Baumeier B, Schmidt V, Kroese DP (2012) Efficient simulation of charge transport in deep-trap media. In: Laroque C, Himmelspach J, Pasupathy R, Rose O, Uhrmacher AM (eds) Proceedings of the 2012 winter simulation conferenceGoogle Scholar
- Choi H, Szyld DB (1996) Application of threshold partitioning of sparse matrices to Markov chains. In: Proceedings of the IEEE international computer performance and dependability symposium, IPDS’96. IEEE Computer Society Press, pp 158–165Google Scholar
- Conway A, Georganas ND (1982) Queueing networks—exact computational algorithms. MIT Press, CambridgeGoogle Scholar
- Evans S (1996) Analysing system behaviour on different time scales. In: Kelly F, Zachary S, Ziedins I (eds) Stochastic networks—theory and applications. Clarendon Press, Oxford, pp 231–246Google Scholar