In the classical risk model, write the surplus as
where is the claim-arrival Poisson process. The ruin time is . The ultimate ruin probability is
The positive root in the question is the adjustment coefficient. The Lundberg inequality and the Cramér–Lundberg approximation are, respectively,
The interior adjustment coefficient ruin prefactor is finite here because lies strictly inside the finite domain of the moment-generating function; the claim-size density supplies the nonarithmetic condition for the asymptotic. Strict convexity makes its denominator positive. The approximation is an asymptotic statement, while the inequality is a bound at every nonnegative initial capital.
The inequality can also be seen directly from the exponential surplus martingale . Its expectation factor per unit time is zero in the exponent because . Apply the optional stopping theorem at , a bounded time. On , , so . Increasing proves the bound without stopping at an unbounded time.
For any nonnegative claim size, the Tonelli theorem applied to gives the exponential tail identity
Combining it with the adjustment equation yields
The density integrates to one by the tail integral formula for moments. Thus has the equilibrium claim-size distribution, and the preceding formula says .
Under the given NBUE condition, the stochastic order comparison is at every . Apply the same exponential tail identity to both variables to obtain
Consequently
and rearrangement proves the adjustment-coefficient lower bound for NBUE claims:
This uses the specified distributional comparison, not an unwarranted assumption that an arbitrary equilibrium claim law is always smaller than its original law.
For the final example, is the shape-two, rate-one gamma distribution, with , survival function , and moment-generating function for . With , the positive adjustment root satisfies
Dividing out the zero root and simplifying gives . Only the smaller root is in the finite-transform interval , so
The equilibrium density and survival function are
Thus for every , proving that this claim law is new better than used in expectation. Finally the lower bound equals . Our exact root is larger because , equivalently . Hence
verifying the requested bound for the example.
Under quota share reinsurance, the direct insurer retains a fixed fraction of each claim and the reinsurer pays the other fraction. Thus their annual claim totals are and . Under excess of loss reinsurance with retention , the direct insurer pays on each individual claim and the reinsurer pays . Under stop loss reinsurance with annual retention , the direct insurer pays and the reinsurer pays . The last two contracts differ because one caps each claim and the other caps the aggregate.
Conditioning on the annual Poisson distribution count gives the compound Poisson distribution transform:
This equality is understood on the domain where the moment-generating function is finite. By the expected value premium principle, annual premium income is . Without reinsurance, final capital is , and therefore
For the quota-share contract, the reinsurer's expected claim cost is , so its annual premium is
The direct insurer keeps its original premium income, pays this reinsurance premium and retains only . Thus
and
The reinsurer's loading is applied to the ceded expected loss, not to the direct insurer's original premium.
Maximizing expected exponential utility is equivalent to minimizing the exponent . For exponential distribution claim sizes of mean ,
so on the finite-utility domain ,
For a nontrivial positive arrival rate, differentiation gives
The unique unconstrained stationary retention is therefore
It is positive and lies below . If , it is the unique optimal retention in the printed range . If , expected utility increases throughout that open interval and its supremum is approached as ; there is no attained maximum in the strictly open range. Allowing the usual no-reinsurance endpoint gives the compact formula
Retentions with have infinite exponential loss moment and expected utility , so they cannot displace the finite stationary solution. The stationary point and full-retention endpoint just described stay within the finite-transform domain whenever they are selected.
For the requested comparisons,
Higher reinsurer loading increases optimal retention, up to full retention: reinsurance is more expensive. The direct insurer's loading does not affect the optimizer. It adds only the constant to , reflecting the translation property of constant absolute risk aversion. These observations give the quota-share retention under exponential utility rule; and the positive arrival rate also drop out of the stationary equation. In the degenerate case , no claims or premiums occur, , and every retained fraction has the same expected utility.
For ordinary homoscedastic fixed-design nonparametric regression, take observations at known distinct sites, with independent mean-zero errors of common variance. A degree- local polynomial estimator at a target solves the finite-dimensional weighted least squares problem
Here is a nonnegative regression kernel, is the smoothing bandwidth, and sufficient local design rank ensures uniqueness. The estimate of the regression function is . Each target has its own locally fitted polynomial; this is not one global polynomial fit. The bandwidth controls the localization and the bias-variance tradeoff.
A natural cubic smoothing spline instead solves the global penalized problem
The Sobolev space here consists of functions with square-integrable weak derivatives through order two. The minimizer is a natural cubic spline with knots at the observation sites and linear tails outside the extreme sites. Equivalently one may perform the minimization on that finite-dimensional spline space: the minimum roughness property of the natural cubic spline interpolant shows that replacing a candidate by the natural spline with the same site values preserves the data loss and decreases the second-derivative penalty. The smoothing parameter controls curvature; it differs from the local bandwidth .
For the interval-average observation problem, the printed upper limit in the loss is an indexing error: there are only responses and intervals, so a term with would involve the undefined and . The coherent loss uses the upper limit . Put and define the linear observation functionals
The intended criterion on is therefore
Unlike the ordinary cubic smoothing spline, this uses interval averages as data and a first-derivative penalty; the resulting spline degree will be two.
Fix any candidate . By the supplied interpolation property, there is a unique quadratic spline with knots , constant on both exterior intervals, such that for every . Put . Then
On each interior knot interval is a constant , and on the two exterior intervals . Integrate by parts separately on the intervals. At every knot the boundary contributions cancel because both and are continuous; the contributions at and vanish because is zero there. Thus
This orthogonality is the key to the quadratic smoothing spline for interval averages. Expanding the roughness penalty gives
The data-fit terms are equal because the interval averages are equal. Consequently,
Equality can occur only if everywhere: the derivative is continuous and its squared integral is zero. Then is constant, and any of its zero interval averages forces that constant to be zero. Therefore every minimizer must equal its matching quadratic spline .
We conclude that the minimizer is a continuously differentiable quadratic spline with knots at the specified sites and constant tails on both exterior intervals. Existence and uniqueness also follow from the supplied interpolation property. The interval-average map identifies the finite-dimensional space of these quadratic splines with , and the criterion becomes a strictly convex quadratic function of that average vector: its data-fit term is , while its penalty is nonnegative and quadratic. It has a unique minimizer, and the strict equality argument above proves uniqueness in the full function class.
An exponential dispersion family of order one has density or mass function, relative to a fixed dominating measure, of the form
where is a scalar natural parameter, is the dispersion parameter, and the support does not depend on . For regular families, is twice differentiable on an open natural-parameter domain and . Known observation weights replace by . “Order one” refers to the scalar canonical statistic , rather than an arbitrary vector of canonical statistics.
Differentiate the normalization , or its discrete counterpart, assuming differentiation under the integral is valid. The first derivative gives . The second derivative gives
Consequently,
The variance function expresses the second derivative in terms of the mean:
A generalized linear model specifies independent responses from an exponential dispersion family, a linear predictor , and a differentiable monotone link function relating it to the response mean by . The family, variance function, covariate design, link function and dispersion specification together define the model. The canonical link function identifies the linear predictor with the natural parameter:
One advantage is that the likelihood equations become particularly simple. With known weights and common dispersion , the score function and negative Hessian matrix for are
The latter does not explicitly depend on the responses, so it equals the expected Fisher information matrix at the same parameter. With full-rank design and positive variances the likelihood is strictly concave in , simplifying optimization. These statements concern the coefficient block at a fixed dispersion value.
Three explicit examples, taking unit weights, are as follows.
For a normal distribution with mean and variance ,
Thus , , , and . Its canonical link function is , the identity link.
For a Poisson distribution with mean and support ,
Here , , , and . Therefore , , and the Poisson canonical link is .
For a Bernoulli distribution with success probability ,
Taking , , , and gives the required form. Its mean and variance function are and . Its canonical link function is , the logit link. The fixed dispersion values in the Poisson and Bernoulli cases are part of those models; an arbitrary continuous dispersion is not being asserted for them.
To test , first fit the unrestricted model and then the restricted model with that component fixed at zero, estimating all nuisance parameters, including dispersion when applicable, in each fit. If and denote their full fitted parameter vectors, the likelihood-ratio test uses
For identifiable regular models, an interior null parameter and a fixed-dimensional full-rank design with increasing information, the Wilks theorem gives under . A level- test rejects for greater than the -quantile of the chi-squared distribution with one degree of freedom.
Alternatively the Wald test uses , with the variance obtained from the appropriate inverse full Fisher information matrix; it has the same limiting null law. The score test fits only the restricted model. If collects its nuisance parameters, its efficient information is , and the statistic is , again asymptotically . Accounting for the nuisance block is necessary rather than using the unadjusted diagonal information.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact