اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFinding Efficient Recursions for Risk Aggregation by Computer Algebra
118
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the assumption that the probability generating function of the claim size be algebraic. The probability generating function of the claim number is supposed to be from the rather general class of D-finite functions.
قيم البحث
اقرأ أيضاً
The Large Deviation Principle is established for stochastic models defined by past-dependent non linear recursions with small noise. In the Markov case we use the result to obtain an explicit expression for the asymptotics of exit time.
Hairers regularity structures transformed the solution theory of singular stochastic partial differential equations. The notions of positive and negative renormalisation are central and the intricate interplay between these two renormalisation proced
ures is captured through the combination of cointeracting bialgebras and an algebraic Birkhoff-type decomposition of bialgebra morphisms. This work revisits the latter by defining Bogoliubov-type recursions similar to Connes and Kreimers formulation of BPHZ renormalisation. We then apply our approach to the renormalisation problem for SPDEs as well as the proposal for resonance based numerical schemes for certain partial differential equations in numerical analysis introduced in a recent work by the first author.
For a directed graph $G(V_n, E_n)$ on the vertices $V_n = {1,2, dots, n}$, we study the distribution of a Markov chain ${ {bf R}^{(k)}: k geq 0}$ on $mathbb{R}^n$ such that the $i$th component of ${bf R}^{(k)}$, denoted $R_i^{(k)}$, corresponds to th
e value of the process on vertex $i$ at time $k$. We focus on processes ${ {bf R}^{(k)}: k geq 0}$ where the value of $R_i^{(k+1)}$ depends only on the values ${ R_j^{(k)}: j to i}$ of its inbound neighbors, and possibly on vertex attributes. We then show that, provided $G(V_n, E_n)$ converges in the local weak sense to a marked Galton-Watson process, the dynamics of the process for a uniformly chosen vertex in $V_n$ can be coupled, for any fixed $k$, to a process ${ mathcal{R}_emptyset^{(r)}: 0 leq r leq k}$ constructed on the limiting marked Galton-Watson tree. Moreover, we derive sufficient conditions under which $mathcal{R}^{(k)}_emptyset$ converges, as $k to infty$, to a random variable $mathcal{R}^*$ that can be characterized in terms of the attracting endogenous solution to a branching distributional fixed-point equation. Our framework can also be applied to processes ${ {bf R}^{(k)}: k geq 0}$ whose only source of randomness comes from the realization of the graph $G(V_n, E_n)$.
Recently, the place of the main programming language for scientific and engineering computations has been little by little taken by Julia. Some users want to work completely within the Julia framework as they work within the Python framework. There a
re libraries for Julia that cover the majority of scientific and engineering computations demands. The aim of this paper is to combine the usage of the Julia framework for numerical computations and for symbolic computations in mathematical modeling problems. The main functional domains determining various variants of the application of computer algebra systems are described. In each of these domains, generic representatives of computer algebra systems in Julia are distinguished. The conclusion is that it is possible (and even convenient) to use computer algebra systems within the Julia framework.
The Expected Shortfall (ES) is one of the most important regulatory risk measures in finance, insurance, and statistics, which has recently been characterized via sets of axioms from perspectives of portfolio risk management and statistics. Meanwhile
, there is large literature on insurance design with ES as an objective or a constraint. A visible gap is to justify the special role of ES in insurance and actuarial science. To fill this gap, we study characterization of risk measures induced by efficient insurance contracts, i.e., those that are Pareto optimal for the insured and the insurer. One of our major results is that we characterize a mixture of the mean and ES as the risk measure of the insured and the insurer, when contracts with deductibles are efficient. Characterization results of other risk measures, including the mean and distortion risk measures, are also presented by linking them to different sets of contracts.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
