A computational algorithm for the coverage probability of a first order autogressive process
From MaRDI portal
Publication:3700640
Recommendations
Cites work
- scientific article; zbMATH DE number 3426744 (Why is no real title available?)
- scientific article; zbMATH DE number 3141621 (Why is no real title available?)
- scientific article; zbMATH DE number 3592801 (Why is no real title available?)
- scientific article; zbMATH DE number 3395169 (Why is no real title available?)
- An Error-Bounded Algorithm for Normal Probabilities of Rectangular Regions
- Asymptotic Independence of the Numbers of High and Low Level Crossings of Stationary Gaussian Processes
- Conditions for the convergence in distribution of maxima of stationary normal processes
- Extreme Values in Samples from $m$-Dependent Stationary Stochastic Processes
- Level-crossing problems for random processes
- Probability Integrals of Multivariate Normal and Multivariate $t^1$
- Sample extremes: an elementary introduction
- The Distribution of Extreme Values in Samples whose Members are Subject to a Markoff Chain Condition
Cited in
(2)
This page was built for publication: A computational algorithm for the coverage probability of a first order autogressive process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3700640)