Asymptotic independence of maximum waiting times for increasing alphabet
✍ Scribed by T. F. Móri
- Publisher
- Springer Netherlands
- Year
- 1992
- Tongue
- English
- Weight
- 341 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We consider the equation (−1)^__m__^∇^__m__^ (__p__∇^__m__^__u__) + ∂__u__ = ƒ in ℝ^__n__^ × [0, ∞] for arbitrary positive integers __m__ and __n__ and under the assumptions __p__ −1, ƒ ϵ __C__ and __p__ > 0. Under the additional assumption that the differential operator (−1)^__m__^∇^__
## Abstract We exhibit an algorithm for finding a maximum independent set (MIS) for __n__ presorted, unweighted circular arcs in time 0(__n__). Unlike previous algorithms, this is achieved by means of trivial postprocessing of the output of a straightforward algorithm for finding an MIS for a set o
A vector time series model with long-memory dependence is introduced. It is assumed that, at each time point, the observations are equi-correlated. The model is based on a fractionally differenced autoregressive process (long-memory) adjoined to a Gaussian sequence with constant autocorrelation. The