Write , and . Then
For , is the limiting circumference and is the fraction of that asymptote attained at the centered day . Under the code's transformations,
The latter expression is the logistic function. The curve also satisfies the logistic growth equation . Its inflection point is at half the asymptote. The original prior permits , in which case it does not describe increasing growth.
The transformation centers day at zero and measures it in standard-deviation units. It reduces numerical scale differences and makes the intercept-like parameter refer to the middle of the observed time range. In nonlinear regression this can reduce posterior parameter dependence and improve Markov chain Monte Carlo mixing. It also makes priors on the growth coefficient easier to interpret; it does not change the curve family.
Integrate the next independent measurement error over the posterior distribution of . The posterior predictive distribution is
Both uncertainty about the personal mean and variation in a new measurement contribute.
By normal-normal conjugacy, the posterior distribution is
The posterior mean is a precision-weighted average of the population mean and the observed personal measurement.
Let be the standard normal distribution quantile. Standardizing the prediction in part (a) gives
This is a one-sided predictive limit; its upper-tail probability is under the specified model.
Write the new measurement as , with independent and . Adding independent normal distributions gives the prior predictive distribution
Put . The independent-count likelihood function is proportional to . Its conjugate prior is , giving the posterior distribution .
Integrate the latent variable out to obtain the hospital's marginal likelihood:
For this becomes . It is a geometric distribution on the nonnegative integers, with success probability . The transformation concerns the likelihood, so no Jacobian is inserted here.
The joint density factors as . In the full conditional distribution of , all factors not involving cancel. The remaining likelihood function and exponential distribution prior give
In shape–rate convention this is , a special case of the Gamma–Poisson hierarchical model. It depends only on the node's observed child and parent , as required for its Gibbs sampler update.
The Bayesian network has a shared parent and, for each hospital, the chain . A plate encloses the hospital-specific pair. Observed counts are shaded; the local rates are latent variables. Conditional on , the pairs are independent.
Figure 1.
Directed graph of a Poisson–exponential hierarchical model
. Details.
For these two simple hypotheses the Bayes factor is the ratio of their normal probability densities:
Therefore , and the posterior odds are .
Under the null, has the standard normal distribution, so the Type I error is . Under the alternative, the Type II error is . Hence , using the supplied rounded normal probabilities.
The positive result's posterior odds of true to false are
Thus being more likely true requires . The question's weak inequality is necessary; equality gives a tie rather than a strict preference.
Let the prior odds be , so . The Type I error gives , while the statistical power gives . By Bayes' theorem,
This is a posterior probability of the null, not the false-positive probability conditional on the null. The distinction is the base-rate effect in a positive study.
Write and keep fixed. Then , , while the fixed observed years and exposures leave unchanged. The credibility factor is
As prior concentration increases without bound,
The beta prior variance is , which tends to zero while its mean stays fixed. Increasing therefore makes the prior increasingly concentrated and reduces the influence of the same finite data. This explains the limiting Bayesian credibility estimate, rather than merely treating as two larger arbitrary parameters.
With fixed positive prior parameters and , total exposure satisfies . Hence as the number of observed years grows, and
Thus the credibility estimate places asymptotically all its weight on the observed policy-weighted claim frequency. The assertion concerns the credibility weight; the scale of the predicted number of claims still includes the known next-year exposure .
Here , so iteration gives
The negative-binomial series , valid for , normalizes this to
This is the negative binomial distribution counting failures before the th success, with success probability . The convention is specified because a negative-binomial variable is sometimes defined to count trials instead. Its count expected value is , and the Panjer recursion begins at . For this reduces to the failure-count geometric distribution.
With and , the recurrence is . Iteration gives . Since , normalization gives
Hence the claim count distribution is a Poisson distribution of mean , and the Panjer recursion begins at .
If , then . Applying the count recurrence successively gives for every . Normalization forces
Thus the claim count distribution is a point mass at zero, and the aggregate claims model also has almost surely. In particular the recursion starts at and gives no positive-loss probabilities.
The Gumbel distribution for maxima has distribution function on the whole real line. For set
Both the centering and scale are elementary, and the scale is positive. For any fixed real , the normalized threshold is positive for all sufficiently large . Writing , a Taylor expansion gives
Consequently,
The logarithm calculation in part (i) now gives
Thus belongs to the maximum domain of attraction of the standard Gumbel distribution. The scale also has the Gumbel auxiliary function interpretation: the reciprocal hazard function is , whose derivative tends to zero at the infinite right endpoint. This agrees with the Von Mises conditions for extreme values, and at gives exactly .

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