混合物 发表于 2025-3-28 17:44:04
Central Limit Theorem Related to MDR-Methodes of the prediction error employing the .-fold cross-validation and an arbitrary penalty function. Here we introduce the regularized versions of the mentioned estimates and prove for them the multidimensional CLT. Statistical variants of the CLT involving self-normalization are discussed as well.外科医生 发表于 2025-3-28 19:32:05
Change Point Detection with Stable AR(1) Errorsrocess we estimate the long run variance by kernel estimators and we develop the corresponding change point test. We also propose ratio statistics which do not depend on the long run variances. Monte Carlo simulations illustrate that the limit results can be used even in case of small and moderate sample sizes.Myofibrils 发表于 2025-3-29 00:28:35
http://reply.papertrans.cn/17/1639/163806/163806_43.pngMorphine 发表于 2025-3-29 05:02:21
https://doi.org/10.1007/978-1-4302-0392-6riables can follow from the given results, and thus the precise asymptotics in the complete moment convergence, law of iterated logarithm and large deviation for self-normalized sums are generalized from one-dimensionally indexed random variables to multidimensionally indexed random variables.平息 发表于 2025-3-29 09:54:24
http://reply.papertrans.cn/17/1639/163806/163806_45.png吸引人的花招 发表于 2025-3-29 14:15:42
http://reply.papertrans.cn/17/1639/163806/163806_46.pngadduction 发表于 2025-3-29 16:01:49
Random Sequences, Series, and Averagesarted at a point. All these results have in common that they are obtained via a martingale approximation in the almost sure sense. We point out several applications of these results to classes of mixing sequences, shift processes, reversible Markov chains, Metropolis Hastings algorithms.Canary 发表于 2025-3-29 22:49:15
http://reply.papertrans.cn/17/1639/163806/163806_48.pngOutspoken 发表于 2025-3-30 03:10:48
http://reply.papertrans.cn/17/1639/163806/163806_49.png让步 发表于 2025-3-30 04:12:03
On the Area of the Largest Square Covered by a Comb-Random-Walk covered. Let .. be the largest integer for which [−.., ..]. is covered at time .. Our main result gives an upper and a lower bound for ... A similar question is investigated for a random walk on the half-plane half-comb lattice.