[1]
Erhardsson, T. (1996). On the number of high excursions of linear growth processes. Stoch. Proc. Appl. 65 31-53.
[2]
Erhardsson, T. (1999). Compound Poisson approximation for Markov chains using
Stein's method. Ann. Probab. 27 565-596.
[3]
Erhardsson, T. (2000). Compound Poisson approximation for the
Johnson-Mehl model. J. Appl. Probab. 37 101-117.
[4]
Erhardsson, T. (2000). Compound Poisson approximation for counts of
rare patterns in Markov chains and extreme sojourns in birth-death
chains. Ann. Appl. Probab. 10 573-591.
[5]
Erhardsson, T. (2000). On stationary renewal reward processes where
most rewards are zero. Probab. Theory Related Fields 117 145-161.
[6]
Erhardsson, T. (2001). On the
number of lost customers in stationary loss systems in the light
traffic case. Queueing Systems Theory Appl. 38 25-47.
[7]
Erhardsson, T. (2001). Refined distributional approximations for the
uncovered set in the Johnson-Mehl model. Stoch. Proc. Appl. 96 243-259.
[1] Erhardsson, T. (2003). Strong memoryless times and rare events in Markov renewal point processes. Ann. Probab., to appear.
[1]
Erhardsson, T. (1995). Poisson convergence of the number of excursions
above a threshold, for uni- and bidirectional "linear growth"
processes. Licentiate Thesis. TRITA-MAT-95-MS-02, Dept. of Mathematics, KTH.
[2]
Erhardsson, T. (1997). Compound Poisson approximation for Markov
chains. Ph.D. Thesis. TRITA-MAT-97-MS-05, Dept. of Mathematics, KTH.
[3]
Erhardsson, T. (1999). On the sum of marks of stationary marked renewal
processes. Dept. of Mathematics and Statistics, University of
Western Australia.
[4]
Erhardsson, T. (2001). Strong memoryless times and rare events in
stationary Markov renewal processes. TRITA-MAT-01-MS-02, Dept. of
Mathematics, KTH.
Åter till Torkel Erhardssons hemsida .
Senast uppdaterad 2004-01-15.