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
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.
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.
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,
The measurement model has the Gaussian likelihood
Marginalizing the latent angular momentum gives the normalized posterior distribution
Its posterior mean is
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.
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 .
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.
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.
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.
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.
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.
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.
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 .
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 each , place and inside a plate replicated times. The directed edges are represented by
The shaded observed nodes are ; the unshaded nodes are latent; and lie outside the plate. This is the probabilistic graphical model encoded by the joint factorization.
Every move can be drawn from a full conditional distribution, producing a Gibbs sampler with acceptance probability one. Write and . First update independently
and then
Let have rows and . Update the linear regression coefficients jointly by
and update
Finally, the flat positive variance priors give the following full conditionals, each an inverse-gamma distribution:
A systematic sweep in the displayed order, using the newly sampled values immediately, defines the chain. The shapes are positive for ; full column rank of is also required.

Articles by others on the same topic (0)

There are currently no matching articles.