scholarly journals Density Estimation in a Continuous-Time Stationary Markov Process

1979 ◽  
Vol 7 (2) ◽  
pp. 341-348 ◽  
Author(s):  
Hung T. Nguyen
Keyword(s):  
Markov Process ◽  
Density Estimation ◽  
Continuous Time ◽  
Stationary Markov Process

COMPARISONS OF DEPENDENCE FOR STATIONARY MARKOV PROCESSES

2000 ◽  
Vol 14 (3) ◽  
pp. 299-315 ◽  
Author(s):  
Taizhong Hu ◽  
Xiaoming Pan
Keyword(s):  
Markov Process ◽  
Markov Processes ◽  
Waiting Time ◽  
Continuous Time ◽  
Queueing Theory ◽  
Stationary Markov Process ◽  
Stationary Waiting Time ◽  
Markov Modulated ◽  
Stationary Workload ◽  
Monotonicity Results

Results and conditions which quantify the decrease in dependence with lag for a stationary Markov process and enable one to compare the dependence for two stationary Markov processes are obtained. The notions of dependence used in this article are the supermodular ordering and the concordance ordering. Both discrete-time and continuous-time Markov processes are considered. Some applications of the main results are given. In queueing theory, the monotonicity results of the waiting time of the nth customer as well as the stationary waiting time in an MR/GI/1 queue and the stationary workload in a Markov-modulated queue are established, thus strengthening previous results while simplifying their derivation. This article is a continuation of those by Fang et al. [7] and Hu and Joe [10].

MANAGEMENT OF THE SUCCESS OF STUDENT’S LEARNING BASED ON THE MARKOV MODEL

2018 ◽  
pp. 4-11
Author(s):  
M. V. Noskov ◽  
M. V. Somova ◽  
I. M. Fedotova
Keyword(s):  
Information System ◽  
Markov Process ◽  
Continuous Time ◽  
Information Technologies ◽  
Educational Process ◽  
Automated Information System ◽  
The Subject ◽  
The University ◽  
Independent Work ◽  
Near Future

The article proposes a model for forecasting the success of student’s learning. The model is a Markov process with continuous time, such as the process of “death and reproduction”. As the parameters of the process, the intensities of the processes of obtaining and assimilating information are offered, and the intensity of the process of assimilating information takes into account the attitude of the student to the subject being studied. As a result of applying the model, it is possible for each student to determine the probability of a given formation of ownership of the material being studied in the near future. Thus, in the presence of an automated information system of the university, the implementation of the model is an element of the decision support system by all participants in the educational process. The examples given in the article are the results of an experiment conducted at the Institute of Space and Information Technologies of Siberian Federal University under conditions of blended learning, that is, under conditions when classroom work is accompanied by independent work with electronic resources.

scholarly journals Mapping TASEP back in time

2021 ◽  
Author(s):  
Leonid Petrov ◽  
Axel Saenz
Keyword(s):  
Markov Process ◽  
Continuous Time ◽  
Exclusion Process ◽  
Discrete Space ◽  
Baxter Equation ◽  
Simple Exclusion Process ◽  
Open Questions ◽  
Asymmetric Simple Exclusion ◽  
Simple Exclusion ◽  
Hammersley Process

AbstractWe obtain a new relation between the distributions $$\upmu _t$$ μ t at different times $$t\ge 0$$ t ≥ 0 of the continuous-time totally asymmetric simple exclusion process (TASEP) started from the step initial configuration. Namely, we present a continuous-time Markov process with local interactions and particle-dependent rates which maps the TASEP distributions $$\upmu _t$$ μ t backwards in time. Under the backwards process, particles jump to the left, and the dynamics can be viewed as a version of the discrete-space Hammersley process. Combined with the forward TASEP evolution, this leads to a stationary Markov dynamics preserving $$\upmu _t$$ μ t which in turn brings new identities for expectations with respect to $$\upmu _t$$ μ t . The construction of the backwards dynamics is based on Markov maps interchanging parameters of Schur processes, and is motivated by bijectivizations of the Yang–Baxter equation. We also present a number of corollaries, extensions, and open questions arising from our constructions.

Dynamic performance evaluation of multi – state systems under non – homogeneous continuous time Markov process degradation using lifetimes in terms of order statistics

2017 ◽  
Vol 231 (3) ◽  
pp. 255-264 ◽  
Author(s):  
Funda Iscioglu
Keyword(s):  
Markov Process ◽  
Order Statistics ◽  
Continuous Time ◽  
Dynamic Performance ◽  
Real Life ◽  
State Change ◽  
Transition Rates ◽  
Lifetime Analysis ◽  
Complete Failure ◽  
Effect Of Age

In multi-state modelling a system and its components have a range of performance levels from perfect functioning to complete failure. Such a modelling is more flexible to understand the behaviour of mechanical systems. To evaluate a system’s dynamic performance, lifetime analysis of a multi-state system has been considered in many research articles. The order statistics related analysis for the lifetime properties of multi-state k-out-of-n systems have recently been studied in the literature in case of homogeneous continuous time Markov process assumption. In this paper, we develop the reliability measures for multi-state k-out-of-n systems by assuming a non-homogeneous continuous time Markov process for the components which provides time dependent transition rates between states of the components. Therefore, we capture the effect of age on the state change of the components in the analysis which is typical of many systems and more practical to use in real life applications.

A note on passage times and infinitely divisible distributions

1967 ◽  
Vol 4 (2) ◽  
pp. 402-405 ◽  
Author(s):  
H. D. Miller
Keyword(s):  
Random Walk ◽  
Markov Process ◽  
Continuous Time ◽  
Random Variables ◽  
Independent Random Variables ◽  
Infinitely Divisible Distributions ◽  
Infinitely Divisible ◽  
Time Intervals ◽  
Mutually Independent ◽  
Passage Times

Let X(t) be the position at time t of a particle undergoing a simple symmetrical random walk in continuous time, i.e. the particle starts at the origin at time t = 0 and at times T1, T1 + T2, … it undergoes jumps ξ1, ξ2, …, where the time intervals T1, T2, … between successive jumps are mutually independent random variables each following the exponential density e–t while the jumps, which are independent of the τi, are mutually independent random variables with the distribution . The process X(t) is clearly a Markov process whose state space is the set of all integers.

Sign in / Sign up

Export Citation Format

Share Document