Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Importance sampling is a variance reduction technique for efficient simulation via a change of measure. In particular, it can be applied to rare event simulation of Markov chains. An optimal change of measure yielding a zero variance estimator always exists, but it explicitly depends on the unknown quantity of interest. Thus, it is typically neither known in advance nor available in simulations. ,  investigate the form of optimal importance sampling for estimating state probabilities in discrete-time Markov chains, both over finite horizon and in steady state.  derive the optimal change of measure by utilizing only a general property, without using a priori knowledge of the quantity of interest. Our results show that optima! importance sampling for Markov chains cannot be performed by simulating an alternative Markov chain, since transition probabilities in each step must depend on the history of the already simulated process. This particularly indicates that combined dynamic/adaptive techniques should be applied, and that some traditional approaches are not really promising, which holds not only for Markov chains but also for higher level models such as Petri nets and Markovian queueing models.
['Werner Sandmann']
I am writing a research paper on a idea On optimal importance sampling for discrete-time Markov chains
[{"from": "human", "value": "I am writing a research paper on a idea On optimal importance sampling for discrete-time Markov chains"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Importance sampling is a variance reduction technique for efficient simulation via a change of measure. In particular, it can be applied to rare event simulation of Markov chains. An optimal change of measure yielding a zero variance estimator always exists, but it explicitly depends on the unknown quantity of interest. Thus, it is typically neither known in advance nor available in simulations. ,  investigate the form of optimal importance sampling for estimating state probabilities in discrete-time Markov chains, both over finite horizon and in steady state.  derive the optimal change of measure by utilizing only a general property, without using a priori knowledge of the quantity of interest. Our results show that optima! importance sampling for Markov chains cannot be performed by simulating an alternative Markov chain, since transition probabilities in each step must depend on the history of the already simulated process. This particularly indicates that combined dynamic/adaptive techniques should be applied, and that some traditional approaches are not really promising, which holds not only for Markov chains but also for higher level models such as Petri nets and Markovian queueing models."}]