A task to connect counting processes to lists of outcomes in combinatorics

2022 ◽  
Vol 65 ◽  
pp. 100932
Author(s):  
Adaline De Chenne ◽  
Elise Lockwood
Keyword(s):  
2018 ◽  
Vol 2018 (1) ◽  
Author(s):  
Rong Li ◽  
Xiuchun Bi ◽  
Shuguang Zhang
Keyword(s):  

2017 ◽  
Vol 12 (1) ◽  
pp. 53-87
Author(s):  
Sophie Donnet ◽  
Vincent Rivoirard ◽  
Judith Rousseau ◽  
Catia Scricciolo

Technometrics ◽  
2007 ◽  
Vol 49 (3) ◽  
pp. 362-362 ◽  
Author(s):  
Shin Ta Liu

2007 ◽  
Vol 2007 ◽  
pp. 1-13
Author(s):  
Don McNickle

We consider some simple Markov and Erlang queues with limited storage space. Although the departure processes from some such systems are known to be Poisson, they actually consist of the superposition of two complex correlated processes, the overflow process and the output process. We measure the cross-correlation between the counting processes for these two processes. It turns out that this can be positive, negative, or even zero (without implying independence). The models suggest some general principles on how big these correlations are, and when they are important. This may suggest when renewal or moment approximations to similar processes will be successful, and when they will not.


Sign in / Sign up

Export Citation Format

Share Document