Asymptotic Efficiency of the Sample Mean in Markov Chain Monte Carlo Schemes
马尔可夫链蒙特卡洛中样本均值的渐近效率AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要主要讨论 MCMC 计算与均值估计效率,未提供宏观时间序列或其他所列领域的直接依据。
马尔可夫链蒙特卡洛中样本均值的渐近效率AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
SUMMARY In many cases, a univariate time series derived from a time reversible stationary Markov chain has the property that there is a distribution function on [–1, 1] ([0, 1]) such that, for all non-negative integers l, its lth moment is the lth lag autocorrelation of the time series. We discuss some consequences of this property. Effects of the asymptotic efficiency of the sample mean on the efficiency of subsampling a stationary Markov chain are discussed. The stationarity assumption is then relaxed. We show that under certain regularity conditions the sample mean of a strongly asymptotically stationary process is asymptotically efficient in that it has the smallest mean-square error asymptotically in a broad class of linear estimators.