Pub Date : 2024-09-19DOI: 10.1007/s11009-024-10105-x
Ata Kabán, Efstratios Palias
We give an upper bound on the conditional error of Quadratic Discriminant Analysis (QDA), conditioned on parameter estimates. In the case of maximum likelihood estimation (MLE), our bound recovers the well-known Chernoff and Bhattacharyya bounds in the infinite sample limit. We perform an empirical assessment of the behaviour of our bound in a finite sample MLE setting, demonstrating good agreement with the out-of-sample error, in contrast with the simpler but uninformative estimated error, which exhibits unnatural behaviour with respect to the sample size. Furthermore, our conditional error bound is applicable whenever the QDA decision function employs parameter estimates that differ from the true parameters, including regularised QDA.
{"title":"A Bhattacharyya-type Conditional Error Bound for Quadratic Discriminant Analysis","authors":"Ata Kabán, Efstratios Palias","doi":"10.1007/s11009-024-10105-x","DOIUrl":"https://doi.org/10.1007/s11009-024-10105-x","url":null,"abstract":"<p>We give an upper bound on the <i>conditional error</i> of Quadratic Discriminant Analysis (QDA), conditioned on parameter estimates. In the case of maximum likelihood estimation (MLE), our bound recovers the well-known Chernoff and Bhattacharyya bounds in the infinite sample limit. We perform an empirical assessment of the behaviour of our bound in a finite sample MLE setting, demonstrating good agreement with the <i>out-of-sample error</i>, in contrast with the simpler but uninformative <i>estimated error</i>, which exhibits unnatural behaviour with respect to the sample size. Furthermore, our conditional error bound is applicable whenever the QDA decision function employs parameter estimates that differ from the true parameters, including regularised QDA.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"188 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142262027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-17DOI: 10.1007/s11009-024-10099-6
José L. Vilar-Zanón, Barbara Rogo
We present a new approach to the problem of characterizing and choosing equivalent martingale pricing measures for a contingent claim, in a finite-state incomplete market. This is the entropy segmentation method achieved by means of convex programming, thanks to which we divide the claim no-arbitrage prices interval into two halves, the buyer’s and the seller’s prices at successive entropy levels. Classical buyer’s and seller’s prices arise when the entropy level approaches 0. Next, we apply Fenchel duality to these primal programs to characterize the hedging positions, unifying in the same expression the cases of super (resp. sub) replication (arising when the entropy approaches 0) and partial replication (when entropy tends to its maximal value). We finally apply linear programming to our hedging problem to find in a price slice of the dual feasible set an optimal partial replicating portfolio with minimal CVaR. We apply our methodology to a cliquet style guarantee, using Heston’s dynamic with parameters calibrated on EUROSTOXX50 index quoted prices of European calls. This way prices and hedging positions take into account the volatility risk.
{"title":"Pricing and Hedging Contingent Claims by Entropy Segmentation and Fenchel Duality","authors":"José L. Vilar-Zanón, Barbara Rogo","doi":"10.1007/s11009-024-10099-6","DOIUrl":"https://doi.org/10.1007/s11009-024-10099-6","url":null,"abstract":"<p>We present a new approach to the problem of characterizing and choosing equivalent martingale pricing measures for a contingent claim, in a finite-state incomplete market. This is the <i>entropy segmentation</i> method achieved by means of convex programming, thanks to which we divide the claim no-arbitrage prices interval into two halves, the buyer’s and the seller’s prices at successive entropy levels. Classical buyer’s and seller’s prices arise when the entropy level approaches 0. Next, we apply Fenchel duality to these primal programs to characterize the hedging positions, unifying in the same expression the cases of super (resp. sub) replication (arising when the entropy approaches 0) and partial replication (when entropy tends to its maximal value). We finally apply linear programming to our hedging problem to find in a price slice of the dual feasible set an optimal partial replicating portfolio with minimal CVaR. We apply our methodology to a cliquet style guarantee, using Heston’s dynamic with parameters calibrated on EUROSTOXX50 index quoted prices of European calls. This way prices and hedging positions take into account the volatility risk.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"63 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142262029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-16DOI: 10.1007/s11009-024-10106-w
Michel Denuit, Christian Y. Robert
This paper considers a risk sharing scheme of independent discrete losses that combines risk retention at individual level, risk transfer for too expensive losses and risk pooling for the middle layer. This ensures that pooled losses can be considered as being uniformly bounded. We study the no-sabotage requirement and diversification effects when the conditional mean risk-sharing rule is applied to allocate pooled losses. The no-sabotage requirement is equivalent to Efron’s monotonicity property for conditional expectations, which is known to hold under log-concavity. Elementary proofs of this result for discrete losses are provided for finite population pools. The no-sabotage requirement and diversification effects are then examined within large pools. It is shown that Efron’s monotonicity property holds asymptotically and that risk can be eliminated under fairly general conditions which are fulfilled in applications.
{"title":"Conditional Mean Risk Sharing of Independent Discrete Losses in Large Pools","authors":"Michel Denuit, Christian Y. Robert","doi":"10.1007/s11009-024-10106-w","DOIUrl":"https://doi.org/10.1007/s11009-024-10106-w","url":null,"abstract":"<p>This paper considers a risk sharing scheme of independent discrete losses that combines risk retention at individual level, risk transfer for too expensive losses and risk pooling for the middle layer. This ensures that pooled losses can be considered as being uniformly bounded. We study the no-sabotage requirement and diversification effects when the conditional mean risk-sharing rule is applied to allocate pooled losses. The no-sabotage requirement is equivalent to Efron’s monotonicity property for conditional expectations, which is known to hold under log-concavity. Elementary proofs of this result for discrete losses are provided for finite population pools. The no-sabotage requirement and diversification effects are then examined within large pools. It is shown that Efron’s monotonicity property holds asymptotically and that risk can be eliminated under fairly general conditions which are fulfilled in applications.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"45 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142262031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-15DOI: 10.1007/s11009-024-10103-z
Dawei Lu, Ting Li, Meng Yuan, Xinmei Shen
This paper considers a multidimensional risk model with cádlág investment return processes, in which there exists some dependence structure among claims and claim-arrival time. Specifically, if claims follow the subexponential distribution or the regular variation distribution, we obtain some precise asymptotic estimates for the finite-time ruin probabilities. In addition, some numerical simulations are presented to test the performance of the theoretical results.
{"title":"Asymptotic Finite-Time Ruin Probabilities for a Multidimensional Risk Model with Subexponential Claims","authors":"Dawei Lu, Ting Li, Meng Yuan, Xinmei Shen","doi":"10.1007/s11009-024-10103-z","DOIUrl":"https://doi.org/10.1007/s11009-024-10103-z","url":null,"abstract":"<p>This paper considers a multidimensional risk model with cádlág investment return processes, in which there exists some dependence structure among claims and claim-arrival time. Specifically, if claims follow the subexponential distribution or the regular variation distribution, we obtain some precise asymptotic estimates for the finite-time ruin probabilities. In addition, some numerical simulations are presented to test the performance of the theoretical results.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"2 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142262030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-05DOI: 10.1007/s11009-024-10104-y
Bryant Davis, James P. Hobert
The self-adjoint, positive Markov operator defined by the Pólya-Gamma Gibbs sampler (under a proper normal prior) is shown to be trace-class, which implies that all non-zero elements of its spectrum are eigenvalues. Consequently, the spectral gap is (1-lambda _*), where (lambda _* in [0,1)) is the second largest eigenvalue. A method of constructing an asymptotically valid confidence interval for an upper bound on (lambda _*) is developed by adapting the classical Monte Carlo technique of Qin et al. (Electron J Stat 13:1790–1812, 2019) to the Pólya-Gamma Gibbs sampler. The results are illustrated using the German credit data. It is also shown that, in general, uniform ergodicity does not imply the trace-class property, nor does the trace-class property imply uniform ergodicity.
由 Pólya-Gamma Gibbs 采样器(在适当的正态先验下)定义的自相关正马尔可夫算子被证明是迹类的,这意味着其谱的所有非零元素都是特征值。因此,频谱差距为(1-lambda _*),其中(lambda _* in [0,1))是第二大特征值。通过将 Qin 等人的经典蒙特卡罗技术(Electron J Stat 13:1790-1812, 2019)应用于 Pólya-Gamma Gibbs 采样器,开发了一种为 (lambda _*) 上界构建渐近有效置信区间的方法。使用德国信贷数据对结果进行了说明。研究还表明,一般来说,均匀遍历性并不意味着迹类属性,迹类属性也不意味着均匀遍历性。
{"title":"Approximating the Spectral Gap of the Pólya-Gamma Gibbs Sampler","authors":"Bryant Davis, James P. Hobert","doi":"10.1007/s11009-024-10104-y","DOIUrl":"https://doi.org/10.1007/s11009-024-10104-y","url":null,"abstract":"<p>The self-adjoint, positive Markov operator defined by the Pólya-Gamma Gibbs sampler (under a proper normal prior) is shown to be trace-class, which implies that all non-zero elements of its spectrum are eigenvalues. Consequently, the spectral gap is <span>(1-lambda _*)</span>, where <span>(lambda _* in [0,1))</span> is the second largest eigenvalue. A method of constructing an asymptotically valid confidence interval for an upper bound on <span>(lambda _*)</span> is developed by adapting the classical Monte Carlo technique of Qin et al. (Electron J Stat 13:1790–1812, 2019) to the Pólya-Gamma Gibbs sampler. The results are illustrated using the German credit data. It is also shown that, in general, uniform ergodicity does not imply the trace-class property, nor does the trace-class property imply uniform ergodicity.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"7 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-24DOI: 10.1007/s11009-024-10096-9
Yakun Liu, Jingchao Li, Jieming Zhou, Yingchun Deng
In this paper, we study the optimal investment and proportional reinsurance problem for an insurer with short-selling and borrowing constraints under the expected value premium principle. The claim process follows a Brownian risk model with a drift. The insurer’s surplus is allowed to invest in one risk-free asset and one risky asset. By using the dynamic programming approach and solving the corresponding boundary-value problems, the optimization objective of maximizing the probability of drawup before drowdown is considered initially. The optimal strategy and the corresponding value function are derived through solving the Hamilton-Jacobi-Bellman (HJB) equation. Moreover, numerical examples are performed to illustrate the effects of model parameters on the optimal strategy. In addition, we verify the optimality of the strategies obtained from the dynamic programming principle by Euler method.
{"title":"Optimal Investment and Reinsurance to Maximize the Probability of Drawup Before Drawdown","authors":"Yakun Liu, Jingchao Li, Jieming Zhou, Yingchun Deng","doi":"10.1007/s11009-024-10096-9","DOIUrl":"https://doi.org/10.1007/s11009-024-10096-9","url":null,"abstract":"<p>In this paper, we study the optimal investment and proportional reinsurance problem for an insurer with short-selling and borrowing constraints under the expected value premium principle. The claim process follows a Brownian risk model with a drift. The insurer’s surplus is allowed to invest in one risk-free asset and one risky asset. By using the dynamic programming approach and solving the corresponding boundary-value problems, the optimization objective of maximizing the probability of drawup before drowdown is considered initially. The optimal strategy and the corresponding value function are derived through solving the Hamilton-Jacobi-Bellman (HJB) equation. Moreover, numerical examples are performed to illustrate the effects of model parameters on the optimal strategy. In addition, we verify the optimality of the strategies obtained from the dynamic programming principle by Euler method.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"24 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-20DOI: 10.1007/s11009-024-10102-0
Ernesto Cruz, Luis Rincón, David J. Santana
The theory of linear recurrence sequences is applied to obtain an explicit formula for the ultimate ruin probability in a discrete-time risk process. It is assumed that the claims distribution is arbitrary but has finite support (varvec{{0,1,ldots ,m+1}}), for some integer (varvec{mge 1}). The method requires finding the zeroes of an m degree polynomial and solving a system of m linear equations. An approximation is derived and some numerical results and plots are provided as examples.
应用线性递推序列理论得到了离散时间风险过程中最终毁灭概率的明确公式。假设索赔分布是任意的,但有有限的支持(varvec{0,1,ldots ,m+1}}),对于某个整数(varvec{mge 1})。该方法需要找到 m 度多项式的零点,并求解 m 个线性方程组。该方法得出了一个近似值,并提供了一些数值结果和图例。
{"title":"Ruin Probabilities as Recurrence Sequences in a Discrete-Time Risk Process","authors":"Ernesto Cruz, Luis Rincón, David J. Santana","doi":"10.1007/s11009-024-10102-0","DOIUrl":"https://doi.org/10.1007/s11009-024-10102-0","url":null,"abstract":"<p>The theory of linear recurrence sequences is applied to obtain an explicit formula for the ultimate ruin probability in a discrete-time risk process. It is assumed that the claims distribution is arbitrary but has finite support <span>(varvec{{0,1,ldots ,m+1}})</span>, for some integer <span>(varvec{mge 1})</span>. The method requires finding the zeroes of an <i>m</i> degree polynomial and solving a system of <i>m</i> linear equations. An approximation is derived and some numerical results and plots are provided as examples.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"183 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-20DOI: 10.1007/s11009-024-10101-1
P.-C.G. Vassiliou
In the present we provide the definition of the new concept of the General Non-Homogeneous Markov System (G-NHMS) and establish the expected population structure of a NHMS in the various states. These results will be the basis to build on the new concepts and the basic theorems of what follows.We then establish the set of all possible expected relative distributions of the initial number of memberships at time t and all possible expected relative distributions of the expansion memberships at time t. We call this set the general expected relative population structure in the states of a G-NHMS. We then proceed by providing the new definitions of weak ergodicity in a G-NHMS and weak ergodicity with a geometrical rate of convergence. We then prove the Theorem 4 which is a new building block in the theory of G-NHMS. We also prove a similar theorem under the assumption that relative expansion of the population vanishes at infinity.We then provide a generalization of the coupling theorem for populations. We proceed then to study the asymptotic behavior of a G-NHMS when the input policy consists of independent non-homogeneous Poisson variates for each time interval (left( t-1,tright] ). It is founded in Theorem 7 that it displays a kind of weak ergodicity behavior, that is, it converges at each step to the row of a stable matrix. This row is independent of the initial distribution and of the asymptotic input policy unlike the results in previous works. Hence it generalizes the result in that works. Finally we illustrate our results numerically for a manpower system with three states.
在本文中,我们将给出一般非均质马尔可夫系统(G-NHMS)这一新概念的定义,并建立非均质马尔可夫系统在不同状态下的预期人口结构。这些结果将成为后续新概念和基本定理的基础。然后,我们将建立 t 时刻初始成员数的所有可能预期相对分布集合,以及 t 时刻扩展成员数的所有可能预期相对分布集合。接下来,我们将给出 G-NHMS 中的弱遍历性和具有几何收敛率的弱遍历性的新定义。然后,我们证明了定理 4,它是 G-NHMS 理论的新基石。我们还在种群的相对膨胀在无穷大时消失的假设下证明了一个类似的定理。然后,我们继续研究当输入策略由每个时间间隔的独立非均质泊松变量组成时,G-NHMS 的渐近行为(left( t-1,tright] )。定理 7 证明,它表现出一种弱遍历性行为,即每一步都收敛于一个稳定矩阵的行。与前人的结果不同,这一行与初始分布和渐进输入策略无关。因此,它概括了前人的结果。最后,我们以一个具有三种状态的人力系统为例,用数值来说明我们的结果。
{"title":"Weak Ergodicity in G-NHMS","authors":"P.-C.G. Vassiliou","doi":"10.1007/s11009-024-10101-1","DOIUrl":"https://doi.org/10.1007/s11009-024-10101-1","url":null,"abstract":"<p>In the present we provide the definition of the new concept of the General Non-Homogeneous Markov System (G-NHMS) and establish the expected population structure of a NHMS in the various states. These results will be the basis to build on the new concepts and the basic theorems of what follows.We then establish the set of all possible expected relative distributions of the initial number of memberships at time <i>t</i> and all possible expected relative distributions of the expansion memberships at time <i>t</i>. We call this set the <i>general expected relative population structure </i>in the states of a G-NHMS. We then proceed by providing the new definitions of weak ergodicity in a G-NHMS and weak ergodicity with a geometrical rate of convergence. We then prove the Theorem 4 which is a new building block in the theory of G-NHMS. We also prove a similar theorem under the assumption that relative expansion of the population vanishes at infinity.We then provide a generalization of the coupling theorem for populations. We proceed then to study the asymptotic behavior of a G-NHMS when the input policy consists of independent non-homogeneous Poisson variates for each time interval <span>(left( t-1,tright] )</span>. It is founded in Theorem 7 that it displays a kind of weak ergodicity behavior, that is, it converges at each step to the row of a stable matrix. This row is independent of the initial distribution and of the asymptotic input policy unlike the results in previous works. Hence it generalizes the result in that works. Finally we illustrate our results numerically for a manpower system with three states.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"60 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-16DOI: 10.1007/s11009-024-10100-2
Nikolaos Limnios, Bei Wu
This paper investigates the asymptotic analysis of the hitting time of Markov-type jump processes (i.e., semi-Markov, Markov, in continuous or discrete time) with a small probability of entering a non-empty terminal subset. This means that absorption is a rare event. The mean hitting time function of all four type processes obeyed the same equation. We obtain unified results of asymptotic approximation in a series scheme or, equivalently, a functional type of mean hitting time.
{"title":"A Unified Approach for Hitting Time of Jump Markov Type Processes","authors":"Nikolaos Limnios, Bei Wu","doi":"10.1007/s11009-024-10100-2","DOIUrl":"https://doi.org/10.1007/s11009-024-10100-2","url":null,"abstract":"<p>This paper investigates the asymptotic analysis of the hitting time of Markov-type jump processes (i.e., semi-Markov, Markov, in continuous or discrete time) with a small probability of entering a non-empty terminal subset. This means that absorption is a rare event. The mean hitting time function of all four type processes obeyed the same equation. We obtain unified results of asymptotic approximation in a series scheme or, equivalently, a functional type of mean hitting time.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"71 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221398","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-14DOI: 10.1007/s11009-024-10092-z
Liangxue Li, Xiaoqian Zheng, Haiwu Huang, Xuejun Wang
In this paper, we establish the complete f-moment convergence and the Marcinkiewicz-Zygmund type strong law of large numbers for weighted sums of extended negatively dependent (END, for short) random variables under sub-linear expectations, which extend and improve corresponding ones in sub-linear expectation space. As applications of the main results, the complete consistency and strong consistency of weighted estimators in nonparametric regression models under sub-linear expectations are also obtained.
{"title":"Strong Convergence Properties for Weighted Sums of Extended Negatively Dependent Random Variables Under Sub-linear Expectations with Statistical Applications","authors":"Liangxue Li, Xiaoqian Zheng, Haiwu Huang, Xuejun Wang","doi":"10.1007/s11009-024-10092-z","DOIUrl":"https://doi.org/10.1007/s11009-024-10092-z","url":null,"abstract":"<p>In this paper, we establish the complete <i>f</i>-moment convergence and the Marcinkiewicz-Zygmund type strong law of large numbers for weighted sums of extended negatively dependent (END, for short) random variables under sub-linear expectations, which extend and improve corresponding ones in sub-linear expectation space. As applications of the main results, the complete consistency and strong consistency of weighted estimators in nonparametric regression models under sub-linear expectations are also obtained.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"6 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}