With the stated flat priors, the full joint density, up to a constant, is
The priors on and contribute constants on , while those on the two variances contribute constants on . These are improper priors, so posterior propriety must be checked; the full-rank, sufficiently large-data case used below is proper.
For one object, the probabilistic graphical model factorization is
Each factor is the normal distribution density specified by the model. This factorization displays the conditional independences of the latent variables and the noisy observations .
Write the target posterior density as and the proposal distribution density as . The Metropolis–Hastings algorithm accepts a proposed move with
For distinct states,
which is symmetric in and . The rejection probability supplies the diagonal part, so the entire transition kernel satisfies detailed balance. Integrating the detailed-balance identity over the starting state proves . Hence the posterior is a stationary distribution; an irreducible Markov chain that is also an aperiodic Markov chain converges uniquely to it.
Use broad proper uniform priors for , , and over physically plausible ranges, and broad log-uniform priors for the positive scales and . Then
A Random-walk Metropolis algorithm can update with a multivariate Gaussian proposal distribution. Initialize several dispersed chains near plausible cross-correlation delays and near the marginal-likelihood optimum; reject proposals outside the prior bounds; discard warm-up while adapting only the proposal scale and covariance; then freeze the kernel and retain a long run. Evaluate trace plots, autocorrelations, acceptance rates, between-chain agreement, and the effective sample size of a Markov chain. Posterior predictive quasar light curves provide a model check.
At the fitted parameters, let and . For prediction times define
The microlensing processes and measurement errors contribute no cross-covariance with the latent quasar light curve. The Gaussian process regression posterior is therefore
The requested pointwise posterior variances are the diagonal entries of the latter matrix.
Stack the observations as and set
Let and denote matrices obtained by evaluating the two Gaussian process covariance kernels. Independence of the quasar light curve, gravitational microlensing, and Gaussian noise processes gives
where . Thus is a multivariate normal distribution and its Gaussian-process marginal likelihood is
The off-diagonal blocks are essential: both images contain the same delayed Ornstein-Uhlenbeck process.
Let and draw independently from an importance density . The unbiased estimator
of has one-sample second moment
By the Cauchy-Schwarz inequality,
Equality holds precisely when , giving the optimal importance density for a single integral
This is circular in practice: constructing and normalizing requires detailed knowledge of the posterior and the expectation of . Here log masses are positive, so the unknown normalizer is the posterior mean being estimated. It is also optimal only for this one integral, not for general posterior summaries.
Conditional independence gives
For each satellite, Bayes theorem gives . Therefore
If is a kernel density estimator for the simulated marginal masses and estimates the posterior based on satellite , then
The one-dimensional integrals can be evaluated by numerical integration on a common mass grid.
For arbitrary nonnegative raw weights , let . The empirical squared coefficient of variation, using variance divisor , is
Substitution into the stated definition gives the usual effective sample size of importance sampling
For normalized weights , this reduces to .
Treat the simulated pairs as samples from the prior . The numerator and denominator of the posterior mean are then ordinary Monte Carlo estimators, so
where the normalized importance sampling weights are
The common Gaussian normalizing constant cancels.
The measurement model has the Gaussian likelihood
Marginalizing the latent angular momentum gives the normalized posterior distribution
Its posterior mean is
By the invariance property of maximum likelihood estimation,
The sampling distribution is , where
has a log-normal distribution with
Writing , its exact fractional bias and variance are
Hence, to leading order,
Under homoskedasticity, write
Then and . Both are unbiased estimators, and their covariance matrix is
Indeed the Fisher information is
and its inverse is exactly the displayed covariance matrix. The estimators therefore attain the multivariate Cramer-Rao bound and are efficient estimators.
Put , , , , and form the weighted means
The two equations obtained from the score function are
Consequently the maximum-likelihood estimators are
The Hessian matrix of the log likelihood is
Its first leading principal minor is negative and its determinant is , so it is a negative-definite matrix. Thus the stationary point is the unique global maximum.
Let
Subtracting the measured distance modulus from the measured apparent magnitude gives
For the Hubble flow, define
The Hubble law, with the Hubble constant parametrized by , gives . After integrating over each intrinsic absolute magnitude and each unobserved true distance modulus, independence therefore gives the likelihood function
The MA(1) model has much smaller AIC, versus , so select MA(1). A nominal Wald 95% interval for its non-intercept parameter is
The estimate is close to the noninvertible boundary , where the regular asymptotic normal approximation becomes poor and likelihood curvature can understate the true one-sided uncertainty. Therefore statement (iii) is the most plausible: the nominal interval is too narrow to attain its stated coverage reliably.
An MA() process is invertible when its innovations admit a causal absolutely summable linear representation in present and past observations. With the backshift operator , MA(1) satisfies
If , the geometric series converges absolutely:
Thus the process is invertible.
An MA() process is
where is white noise of variance . For MA(1), and
The transformation leaves this autocovariance unchanged. A Gaussian process is determined by its mean and covariance, so the parameters are not identifiable unless one selects, for example, the invertible representative .

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