Efficient computation of the stochastic behavior of partial sum processes
From MaRDI portal
Publication:2184415
DOI10.1007/s00180-019-00920-zzbMath1505.62350arXiv1712.04712OpenAlexW2973344049WikidataQ127226610 ScholiaQ127226610MaRDI QIDQ2184415
Seksan Kiatsupaibul, Wei Liu, Sorawit Saengkyongam, Anthony J. Hayter
Publication date: 28 May 2020
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.04712
reliabilitystochastic controlconditional probabilitypartial sumsrecursive computationsproduct quality assessment
Uses Software
Cites Work
- Unnamed Item
- Analysis of quadrature methods for pricing discrete barrier options
- Rank constrained distribution and moment computations
- Hit-and-run mixes fast
- Recursive formulas for multinomial probabilities with applications
- Recursive integration methodologies with statistical applications
- Recursive confidence band construction for an unknown distribution function
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- An analysis of a variation of hit-and-run for uniform sampling from general regions
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Approximations to the probability integral and certain percentage points of a multivariate analogue of Student's t-distribution
This page was built for publication: Efficient computation of the stochastic behavior of partial sum processes
