Modeling of Combined Heat and Power Generating Power Plant Units Using Markov Processes with Continuous Time Parameter and Discrete State Space

2011 ◽  
Vol 39 (10) ◽  
pp. 1031-1044 ◽  
Author(s):  
András István Fazekas ◽  
Éva V. Nagy
1979 ◽  
Vol 11 (2) ◽  
pp. 397-421 ◽  
Author(s):  
M. Yadin ◽  
R. Syski

The matrix of intensities of a Markov process with discrete state space and continuous time parameter undergoes random changes in time in such a way that it stays constant between random instants. The resulting non-Markovian process is analyzed with the help of supplementary process defined in terms of variations of the intensity matrix. Several examples are presented.


2015 ◽  
Vol 12 (107) ◽  
pp. 20150225 ◽  
Author(s):  
C. M. Pooley ◽  
S. C. Bishop ◽  
G. Marion

Bayesian statistics provides a framework for the integration of dynamic models with incomplete data to enable inference of model parameters and unobserved aspects of the system under study. An important class of dynamic models is discrete state space, continuous-time Markov processes (DCTMPs). Simulated via the Doob–Gillespie algorithm, these have been used to model systems ranging from chemistry to ecology to epidemiology. A new type of proposal, termed ‘model-based proposal’ (MBP), is developed for the efficient implementation of Bayesian inference in DCTMPs using Markov chain Monte Carlo (MCMC). This new method, which in principle can be applied to any DCTMP, is compared (using simple epidemiological SIS and SIR models as easy to follow exemplars) to a standard MCMC approach and a recently proposed particle MCMC (PMCMC) technique. When measurements are made on a single-state variable (e.g. the number of infected individuals in a population during an epidemic), model-based proposal MCMC (MBP-MCMC) is marginally faster than PMCMC (by a factor of 2–8 for the tests performed), and significantly faster than the standard MCMC scheme (by a factor of 400 at least). However, when model complexity increases and measurements are made on more than one state variable (e.g. simultaneously on the number of infected individuals in spatially separated subpopulations), MBP-MCMC is significantly faster than PMCMC (more than 100-fold for just four subpopulations) and this difference becomes increasingly large.


1979 ◽  
Vol 11 (02) ◽  
pp. 397-421
Author(s):  
M. Yadin ◽  
R. Syski

The matrix of intensities of a Markov process with discrete state space and continuous time parameter undergoes random changes in time in such a way that it stays constant between random instants. The resulting non-Markovian process is analyzed with the help of supplementary process defined in terms of variations of the intensity matrix. Several examples are presented.


1974 ◽  
Vol 11 (04) ◽  
pp. 669-677 ◽  
Author(s):  
D. R. Grey

Results on the behaviour of Markov branching processes as time goes to infinity, hitherto obtained for models which assume a discrete state-space or discrete time or both, are here generalised to a model with both state-space and time continuous. The results are similar but the methods not always so.


1974 ◽  
Vol 11 (4) ◽  
pp. 669-677 ◽  
Author(s):  
D. R. Grey

Results on the behaviour of Markov branching processes as time goes to infinity, hitherto obtained for models which assume a discrete state-space or discrete time or both, are here generalised to a model with both state-space and time continuous. The results are similar but the methods not always so.


1967 ◽  
Vol 30 ◽  
pp. 47-56 ◽  
Author(s):  
Masatoshi Fukushima ◽  
Masuyuki Hitsuda

We shall consider a class of Markov processes (n(t), x(t)) with the continuous time parameter t∈e[0, ∞), whose state space is {1, 2,..., N}×R1. We shall assume that the processes are spacially homogeneous with respect to X∈R1. In detail, our assumption is that the transition functionFij(x,t) = P(n(t) = j, x(t)≦x|n(0) = i,x(0) = 0), t > 0, 1≦i, j,≦N, x∈R1satisfies following conditions (1, 1)~(1,4).


Sign in / Sign up

Export Citation Format

Share Document