scholarly journals Distributional Properties of Fluid Queues Busy Period and First Passage Times

Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 1988
Author(s):  
Zbigniew Palmowski

In this paper, I analyze the distributional properties of the busy period in an on-off fluid queue and the first passage time in a fluid queue driven by a finite state Markov process. In particular, I show that the first passage time has a IFR distribution and the busy period in the Anick-Mitra-Sondhi model has a DFR distribution.

1985 ◽  
Vol 22 (1) ◽  
pp. 185-196 ◽  
Author(s):  
David Assaf ◽  
Moshe Shared ◽  
J. George shanthikumar

It is shown that if a finite-state continuous-time Markov process can be uniformized such that the embedded Markov chain has a TPr (totally positive of order r) transition matrix, then the first-passage time from state 0 to any other state has a PFr (Polya frequency of order r) density. As a consequence, results of Keilson (1971), Esary, Marshall and Proschan (1973), Ghosh and Ebrahimi (1982) and Derman, Ross and Schechner (1983) are strengthened. It is also shown that some cumulative damage shock models, with an underlying compound Poisson process and ‘damages' which are not necessarily non-negative, are associated with wear processes having PFr first-passage times to any threshold. First-passage times with completely monotone densities are also discussed.


1997 ◽  
Vol 34 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Haijun Li ◽  
Moshe Shaked

Using a matrix approach we discuss the first-passage time of a Markov process to exceed a given threshold or for the maximal increment of this process to pass a certain critical value. Conditions under which this first-passage time possesses various ageing properties are studied. Some results previously obtained by Li and Shaked (1995) are extended.


1985 ◽  
Vol 22 (01) ◽  
pp. 185-196
Author(s):  
David Assaf ◽  
Moshe Shared ◽  
J. George shanthikumar

It is shown that if a finite-state continuous-time Markov process can be uniformized such that the embedded Markov chain has a TPr (totally positive of order r) transition matrix, then the first-passage time from state 0 to any other state has a PF r (Polya frequency of order r) density. As a consequence, results of Keilson (1971), Esary, Marshall and Proschan (1973), Ghosh and Ebrahimi (1982) and Derman, Ross and Schechner (1983) are strengthened. It is also shown that some cumulative damage shock models, with an underlying compound Poisson process and ‘damages' which are not necessarily non-negative, are associated with wear processes having PF r first-passage times to any threshold. First-passage times with completely monotone densities are also discussed.


1997 ◽  
Vol 34 (01) ◽  
pp. 1-13 ◽  
Author(s):  
Haijun Li ◽  
Moshe Shaked

Using a matrix approach we discuss the first-passage time of a Markov process to exceed a given threshold or for the maximal increment of this process to pass a certain critical value. Conditions under which this first-passage time possesses various ageing properties are studied. Some results previously obtained by Li and Shaked (1995) are extended.


1980 ◽  
Vol 45 (3) ◽  
pp. 777-782 ◽  
Author(s):  
Milan Šolc

The establishment of chemical equilibrium in a system with a reversible first order reaction is characterized in terms of the distribution of first passage times for the state of exact chemical equilibrium. The mean first passage time of this state is a linear function of the logarithm of the total number of particles in the system. The equilibrium fluctuations of composition in the system are characterized by the distribution of the recurrence times for the state of exact chemical equilibrium. The mean recurrence time is inversely proportional to the square root of the total number of particles in the system.


1989 ◽  
Vol 3 (1) ◽  
pp. 77-88 ◽  
Author(s):  
Joseph Abate ◽  
Ward Whitt

The distribution of upward first passage times in skip-free Markov chains can be expressed solely in terms of the eigenvalues in the spectral representation, without performing a separate calculation to determine the eigenvectors. We provide insight into this result and skip-free Markov chains more generally by showing that part of the spectral theory developed for birth-and-death processes extends to skip-free chains. We show that the eigenvalues and eigenvectors of skip-free chains can be characterized in terms of recursively defined polynomials. Moreover, the Laplace transform of the upward first passage time from 0 to n is the reciprocal of the nth polynomial. This simple relationship holds because the Laplace transforms of the first passage times satisfy the same recursion as the polynomials except for a normalization.


2019 ◽  
Author(s):  
Vishal Singh ◽  
Parbati Biswas

Protein aggregation is investigated theoretically via protein turnover, misfolding, aggregation and degradation. The Mean First Passage Time (MFPT) of aggregation is evaluated within the framework of Chemical Master Equation (CME) and pseudo first order kinetics with appropriate boundary conditions. The rate constants of aggregation of different proteins are calculated from the inverse MFPT, which show an excellent match with the experimentally reported rate constants and those extracted from the ThT/ThS fluorescence data. Protein aggregation is found to be practically independent of the number of contacts and the critical number of misfolded contacts. The age of appearance of aggregation-related diseases is obtained from the survival probability and the MFPT results, which matches with those reported in the literature. The calculated survival probability is in good agreement with the only available clinical data for Parkinson’s disease.<br>


2011 ◽  
Vol 48 (03) ◽  
pp. 713-722
Author(s):  
P. Zipkin

Durbin (1992) derived a convergent series for the density of the first passage time of a Weiner process to a curved boundary. We show that the successive partial sums of this series can be expressed as the iterates of the standard substitution method for solving an integral equation. The calculation is thus simpler than it first appears. We also show that, under a certain condition, the series converges uniformly. This strengthens Durbin's result of pointwise convergence. Finally, we present a modified procedure, based on scaling, which sometimes works better. These approaches cover some cases that Durbin did not.


1985 ◽  
Vol 22 (02) ◽  
pp. 461-466
Author(s):  
Valeri T. Stefanov

Let {Xt } t≧0 (t may be discrete or continuous) be a random process whose finite-dimensional distributions are of exponential type. The first-passage time inf{t:Xt ≧f(t)}, where f(t) is a positive, continuous function, such that f(t)= o(t) as t↑∞, is considered. The problem of finiteness of its moments is solved for both the case that {Xt } t≧0 has stationary independent increments as well as the case in which no assumptions are made about stationarity and independence for the increments of the process. Applications to sequential estimation are also given.


1975 ◽  
Vol 12 (02) ◽  
pp. 324-332
Author(s):  
Allan Gut

Let Sn, n = 1, 2, ‥, denote the partial sums of i.i.d. random variables with the common distribution function F and positive, finite mean. Let N(c) = min [k; Sk &gt; c‥kp ], c ≥ 0, 0 ≤ p &lt; 1. Under the assumption that F belongs to the domain of attraction of a stable law with index α, 1 &lt; α ≤ 2, functional central limit theorems for the first passage time process N(nt), 0 ≤ t ≤ 1, when n → ∞, are derived in the function space D[0,1].


Sign in / Sign up

Export Citation Format

Share Document