Efficient simulation of Markov chains using segmentation

DOI10.1007/s11009-013-9327-xzbMath1310.65010OpenAlexW2124398443WikidataQ60215006 ScholiaQ60215006MaRDI QIDQ479160

Björn Baumeier, Volker Schmidt, Ole Stenzel, Tim Brereton, Denis Andrienko, Dirk P. Kroese

Publication date: 5 December 2014

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-013-9327-x

zbMATH Keywords

Monte Carlonumerical examplesMarkov chainelectron transportsegmentationmobilitygraph-theoretic decompositionnearly-completely decomposableorganic semiconductorwatershed

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)

Related Items (1)

A General Framework for Consistent Estimation of Charge Transport Properties via Random Walks in Random Environments

Cites Work

• An introduction to kinetic Monte Carlo simulations of surface reactions.
• A General Framework for Consistent Estimation of Charge Transport Properties via Random Walks in Random Environments
• Aggregation of Variables in Dynamic Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient simulation of Markov chains using segmentation