1978
DOI: 10.1080/03461238.1978.10419477
|View full text |Cite
|
Sign up to set email alerts
|

Infinitely divisible sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

1980
1980
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…Since / ) ( A^ -k) -r n _ k q k and r n -> (EL + )"' (apply Theorem 4.2 of Hawkes et al (1978)) we have…”
Section: >N) and Q H = P(n~ = N) = P(l + > N)mentioning
confidence: 99%
See 2 more Smart Citations
“…Since / ) ( A^ -k) -r n _ k q k and r n -> (EL + )"' (apply Theorem 4.2 of Hawkes et al (1978)) we have…”
Section: >N) and Q H = P(n~ = N) = P(l + > N)mentioning
confidence: 99%
“…In this paper our main concern is with the asymptotic behaviour of p n /a n , as opposed to that of (2 k>n Pk)/(^k»n <**)• Special cases have already been considered by Hawkes et al (1978) (in particular in Theorem 3.1). E. M. Wright (1967) works with the system of equations (3) but with the side conditions p o = 1, X = 1 and 2 a, = oo, he proved that the following statements are equivalent:…”
Section: (2)mentioning
confidence: 99%
See 1 more Smart Citation
“…The theory of infinitely divisible distributions began with de Finetti [4]. See, e.g., Wright [30], Hawkes and Jenkins [9], van Harn [28], Embrechts and Hawkes [5] and Steutel and van Harn [26] for background and results in the discrete case which are pertinent to the current article. Often, when two sequences are related in this way, asymptotic information can be transferred between them.…”
Section: Introductionmentioning
confidence: 99%
“…Often, when two sequences are related in this way, asymptotic information can be transferred between them. The purpose of this note is to point out that the asymptotics of S n can be obtained from those of N n , via the limit theory developed in [5,9]. See Section 3 for the proof of Theorem 1.…”
Section: Introductionmentioning
confidence: 99%