Simulation for passage times in non-Markovian networks of queues

1986 ◽  
pp. 13-40
Author(s):  
Donald L. Iglehart ◽  
Gerarld S. Shedler
Keyword(s):  
Networks Of Queues ◽  
Passage Times

Statistical efficiency of regenerative simulation methods for networks of queues

1983 ◽  
Vol 15 (1) ◽  
pp. 183-197 ◽  
Author(s):  
Donald L. Iglehart ◽  
Gerald S. Shedler
Keyword(s):  
Passage Time ◽  
General Function ◽  
Simulation Methods ◽  
Statistical Efficiency ◽  
Multiclass Networks ◽  
Regenerative Simulation ◽  
Time Information ◽  
General Service ◽  
Networks Of Queues ◽  
Passage Times

This paper is concerned with the assessment of the statistical efficiency of proposed regenerative simulation methods. We compare the efficiency of the ‘marked job' and ‘labelled jobs' methods for estimation of passage times in multiclass networks of queues with general service times. Using central limit theorem arguments, we show that the confidence intervals constructed for the expected value of a general function of the limiting passage time using the labelled jobs method are shorter than those obtained from the marked job method. This is consistent with intuition since the labelled jobs method extracts more passage-time information from a fixed-length simulation run.

Statistical efficiency of regenerative simulation methods for networks of queues

1983 ◽  
Vol 15 (01) ◽  
pp. 183-197 ◽  
Author(s):  
Donald L. Iglehart ◽  
Gerald S. Shedler
Keyword(s):  
Passage Time ◽  
General Function ◽  
Simulation Methods ◽  
Statistical Efficiency ◽  
Multiclass Networks ◽  
Regenerative Simulation ◽  
Time Information ◽  
General Service ◽  
Networks Of Queues ◽  
Passage Times

This paper is concerned with the assessment of the statistical efficiency of proposed regenerative simulation methods. We compare the efficiency of the ‘marked job' and ‘labelled jobs' methods for estimation of passage times in multiclass networks of queues with general service times. Using central limit theorem arguments, we show that the confidence intervals constructed for the expected value of a general function of the limiting passage time using the labelled jobs method are shorter than those obtained from the marked job method. This is consistent with intuition since the labelled jobs method extracts more passage-time information from a fixed-length simulation run.

First passage time for the state of exact chemical equilibrium

1980 ◽  
Vol 45 (3) ◽  
pp. 777-782 ◽  
Author(s):  
Milan Šolc
Keyword(s):  
Chemical Equilibrium ◽  
First Passage Time ◽  
Passage Time ◽  
The State ◽  
Recurrence Time ◽  
First Passage ◽  
First Order ◽  
The Mean ◽  
Passage Times ◽  
Number Of Particles

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.

scholarly journals Local stationarity in exponential last-passage percolation

2021 ◽  
Author(s):  
Márton Balázs ◽  
Ofer Busani ◽  
Timo Seppäläinen
Keyword(s):  
Brownian Motion ◽  
Total Variation ◽  
High Probability ◽  
Probabilistic Methods ◽  
Side Length ◽  
Last Passage Percolation ◽  
Last Passage Times ◽  
Starting Point ◽  
Point To Point ◽  
Passage Times

AbstractWe consider point-to-point last-passage times to every vertex in a neighbourhood of size $$\delta N^{\nicefrac {2}{3}}$$ δ N 2 3 at distance N from the starting point. The increments of the last-passage times in this neighbourhood are shown to be jointly equal to their stationary versions with high probability that depends only on $$\delta $$ δ . Through this result we show that (1) the $$\text {Airy}_2$$ Airy 2 process is locally close to a Brownian motion in total variation; (2) the tree of point-to-point geodesics from every vertex in a box of side length $$\delta N^{\nicefrac {2}{3}}$$ δ N 2 3 going to a point at distance N agrees inside the box with the tree of semi-infinite geodesics going in the same direction; (3) two point-to-point geodesics started at distance $$N^{\nicefrac {2}{3}}$$ N 2 3 from each other, to a point at distance N, will not coalesce close to either endpoint on the scale N. Our main results rely on probabilistic methods only.

Sign in / Sign up

Export Citation Format

Share Document