## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 465-484 |

Number of pages | 20 |

Journal | Methodology and Computing in Applied Probability |

Volume | 16 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2014 |

Externally published | Yes |

## Keywords

- Electron transport
- Graph-theoretic decomposition
- Markov chain
- Mobility
- Monte Carlo
- Nearly-completely decomposable
- Organic semiconductor
- Segmentation
- Watershed