---
title: Random Double Truncation Methods and Theory
url: https://www.emergentmind.com/topics/random-double-truncation
type: topic
---

# Random Double Truncation Methods and Theory

Random double truncation is an observation mechanism in which an underlying variable is retained only when it falls inside a two-sided window, while the window itself may be random or the truncation event may be random because it depends on latent variables. In the classical statistical formulation, one observes a triplet \((U,X,V)\) only if \(U \le X \le V\), so the data are drawn from the conditional law given inclusion rather than from the target law. The same phrase also appears in Gaussian latent-variable models, where fixed bounds generate random truncation events because they are applied to random coordinates, and in random matrix theory, where independent row and column selections induce a two-parameter random truncation field. Across these formulations, the common themes are bias induced by selective observation, likelihoods defined on truncated support, inverse-probability correction, and asymptotic analysis of estimators or stochastic processes [2103.14153] [1911.07694] [1302.6539] [1206.5387].

## 1. Core definitions and principal formulations

In survival analysis and related sampling problems, random double truncation is defined through random truncation variables \((U^*,V^*)\), with observation of \((U^*,X^*,V^*)\) only when \(U^* \le X^* \le V^*\). Under independent truncation, the sampling probability function is
$$
G(x)=P(U^* \le x \le V^*),
$$
and the observed density is
$$
f^*(x)=\frac{G(x)f(x)}{\alpha}, \qquad \alpha=P(U^* \le X^* \le V^*)=\int G(t)F(dt).
$$
Hence the observed distribution is biased unless \(G\) is constant on the support of \(X^*\). A particularly important special case is interval sampling, \(V^*=U^*+\tau\), where each subject is observable only if the event occurs inside a calendar-time window of width \(\tau\) [2103.14153] [2301.03698].

The cited literature also uses the term for mechanisms that do not discard observations outright. In the zero-inflated Gaussian model, the latent vector \(X=(X_1,\dots,X_p)\sim\mathcal N_p(\mu,\Sigma^*)\) is transformed coordinatewise by
$$
Y_j=\mathbf 1_{a_j\le X_j\le b_j}\,X_j,
$$
so out-of-range latent values are replaced by zero rather than removed. The bounds \((a_j,b_j)\) are fixed and known, but truncation is random overall because it depends on the random Gaussian coordinates. In the random matrix setting, a Haar-distributed matrix \(U\) is “doubly truncated” by independently retaining row \(i\) if \(R_i\le s\) and column \(j\) if \(C_j\le t\), leading to
$$
\widetilde T^{(n)}(s,t)=\sum_{i,j=1}^n |U_{ij}|^2\,1_{\{R_i\le s\}}\,1_{\{C_j\le t\}}.
$$
In multivariate normal theory, double truncation refers to conditioning a Gaussian vector on a rectangle \(a\le X\le b\), with some bounds possibly infinite [1911.07694] [1302.6539] [1206.5387].

| Setting | Observation rule | Main inferential object |
|---|---|---|
| Survival and registry data | Observe iff \(U \le X \le V\) | \(F\), \(\lambda\), regression effects |
| Zero-inflated Gaussian data | \(Y_j=\mathbf 1_{a_j\le X_j\le b_j}X_j\) | \(\Sigma^*\), \(\Theta^*\), graph structure |
| Haar or orthogonal matrices | Keep row \(i\) if \(R_i\le s\), column \(j\) if \(C_j\le t\) | Limit of truncated norm process |
| Doubly truncated MVN | Condition on \(a\le X\le b\) | Truncated moments and marginals |

## 2. Distributional structure and likelihoods on truncated support

The basic effect of random double truncation is that the observed law is not the target law. For the classical survival model,
$$
F^*(x)=P(X\le x\mid U\le X\le V)=\frac{1}{\alpha}\int_{a_X}^x G(t)\,dF(t),
$$
and the inverse-probability identity
$$
F(x)=\alpha\int_{a_X}^x \frac{1}{G(t)}\,dF^*(t)
$$
shows that estimation of \(F\) requires correction by the sampling probability. This identity underlies both nonparametric maximum likelihood and semiparametric weighting procedures [2103.14153] [2301.03698].

In the Gaussian zero-inflation model, the full likelihood of the observed vector \(Y\) involves \(2^p\) zero/nonzero patterns and multiple integrals up to order \(p\), so the analysis proceeds through bivariate marginals. For each pair \((j,k)\), the single-observation likelihood is written as a sum of four contributions, \(\phi_{00,jk}\), \(\phi_{01,jk}\), \(\phi_{10,jk}\), and \(\phi_{11,jk}\), corresponding respectively to both coordinates truncated, only \(j\) truncated, only \(k\) truncated, and both observed. The terms \(\phi_{01}\), \(\phi_{10}\), and \(\phi_{00}\) integrate the latent Gaussian density over complements of the truncation intervals, which makes the likelihood explicitly dependent on the truncation geometry [1911.07694].

For a doubly truncated multivariate normal vector \(X\sim N_d(\mu,\Sigma)\), the conditional density on a rectangle is
$$
f_{X\mid a\le X\le b}(x)=
\begin{cases}
\dfrac{\varphi_{\mu,\Sigma}(x)}{\alpha}, & a\le x\le b,\\[6pt]
0,& \text{otherwise},
\end{cases}
$$
with \(\alpha=P_\mu(a\le X\le b)\). Using a Tallis-type mgf argument, explicit formulas are obtained for truncated moments and for bivariate marginal densities \(F_{q,r}(x_q,x_r)\). These marginals enter directly into the second-moment formulas, so the doubly truncated MVN is treated not merely as a conditional density but as a fully computable moment system [1206.5387].

In the random matrix model, the centered truncated field admits the decomposition
$$
T^{(n)}(s,t)-\mathbb E T^{(n)}(s,t)=Z^{(n)}(s,t)+n^{1/2}W^{(n)}(s,t),
$$
where \(W^{(n)}\) is built from the empirical processes of the row and column selectors and \(Z^{(n)}\) captures the residual contribution of matrix-entry fluctuations. This decomposition isolates the two distinct sources of randomness: the truncation mask itself and the underlying Haar matrix [1302.6539].

## 3. Estimation strategies

A central estimator under random double truncation is the Efron–Petrosian nonparametric maximum likelihood estimator. Writing \(F_n^*\) for the empirical cdf of the observed \(X_i\)'s and \(G_n\) for the estimated sampling probability, the estimator has the inverse-probability form
$$
F_n(x)=\alpha_n\int_{a_F}^{x}\frac{F_n^*(dt)}{G_n(t)},
$$
with
$$
\alpha_n=\left(\int_{a_F}^{\infty} G_n^{-1}(t)\,F_n^*(dt)\right)^{-1}.
$$
This representation makes explicit that doubly truncated observations are reweighted by \(G_n(X_i)^{-1}\) to recover the target distribution [2103.14153].

Hazard estimation under random double truncation is built on this IPW representation. The nonparametric kernel hazard estimator smooths the cumulative hazard induced by \(F_n\), while the semiparametric version replaces \(G_n\) by a parametric \(G_{\hat\theta}\) derived from a model \(T_\theta\) for the truncation law. The semiparametric kernel hazard estimator is
$$
\lambda_{\hat\theta,h}(x)
=
\alpha_{\hat\theta}\frac{1}{n}\sum_{i=1}^{n}
K_h(x-X_i)
\frac{G_{\hat\theta}^{-1}(X_i)}{1-F_{\hat\theta}(X_i^-)}.
$$
This formulation makes the truncation correction explicit and was introduced to avoid the nonexistence, nonuniqueness, and high-variance issues of the fully nonparametric NPMLE in severe truncation regimes [2103.14153].

For Cox regression with left, right, or double truncation under dependent truncation, the key assumption is conditional independence,
$$
T \perp (L,R)\mid Z.
$$
The conditional likelihood of the observed sample includes the selection term
$$
\alpha_i(\beta,\lambda)
=
\exp\{-\Lambda(L_i)\exp(\beta^\top Z_i)\}
-
\exp\{-\Lambda(R_i)\exp(\beta^\top Z_i)\},
$$
and is maximized by an EM algorithm. The E-step constructs expected counts for latent truncated event times, and the M-step solves a weighted Cox score equation on a pseudo-dataset with standard `coxph`-style software. This procedure avoids modeling the joint distribution of \((L,R)\) and directly adjusts the risk sets through the conditional likelihood [1803.09830].

In the zero-inflated Gaussian graphical model, estimation is two-step. First, each latent covariance entry is estimated by maximizing the corresponding bivariate marginal log-likelihood,
$$
\widetilde\Sigma^{(n)}_{jk}
=
\arg\max_{|\sigma|\le 1} L^{(n)}_{jk}(\sigma,y).
$$
Second, the estimated covariance matrix is plugged into graphical lasso,
$$
\widetilde\Theta^{(n)}
=
\arg\max_{\Theta\succ 0}
\left\{
\log\det(\Theta)
-
\operatorname{tr}(\Theta\widetilde\Sigma^{(n)})
-
\lambda_n\|\Theta\|_{1,\mathrm{off}}
\right\},
$$
so that sparsity of the latent precision matrix \(\Theta^*=(\Sigma^*)^{-1}\) encodes the recovered graph [1911.07694].

For doubly truncated multivariate normals, the estimation problem is often analytic rather than iterative. The truncated mean satisfies
$$
\mathbb E(Y_i\mid a^*\le Y\le b^*)
=
\mu_i+\sum_{k=1}^d \sigma_{ik}\big(F_k(a_k)-F_k(b_k)\big),
$$
and explicit second-moment formulas involve the bivariate truncated marginals \(F_{kq}\). These formulas are implemented in the `tmvtnorm` package, while numerical evaluation of the required Gaussian probabilities relies on `mvtnorm::pmvnorm()` [1206.5387].

## 4. Asymptotic theory and limit behavior

The cited literature shows that random double truncation does not preclude rigorous asymptotic theory, but it changes the form of the empirical process and often inflates constants or introduces additional regularity conditions. For kernel hazard estimation, the practical estimators \(\lambda_h\) and \(\lambda_{\hat\theta,h}\) are first-order equivalent to the oracle estimator
$$
\bar\lambda_h(x)
=
\alpha \frac{1}{n}\sum_{i=1}^{n}
K_h(x-X_i)\frac{G^{-1}(X_i)}{1-F(X_i^-)}.
$$
Under the stated regularity assumptions, \(\bar\lambda_h(x)\) is pointwise consistent and asymptotically normal, the bias is
$$
E[\bar\lambda_h(x)] = \lambda(x)+\frac{1}{2}h^2\lambda''(x)\mu_2(K)+o(h^2),
$$
and the variance is
$$
\mathrm{Var}[\bar\lambda_h(x)]
=
(nh)^{-1}\,
\alpha \frac{G^{-1}(x)}{1-F(x)}\lambda(x)R(K)
+
o((nh)^{-1}).
$$
The resulting AMISE-optimal bandwidth remains of order \(n^{-1/5}\), with truncation entering through \(G\) in the constant [2103.14153].

For the Cox model under dependent truncation, the EM-based MLE is strongly consistent: \(\widehat\beta\) converges almost surely to \(\beta_0\), and \(\widehat\Lambda\) converges almost surely and uniformly on \([0,\tau]\) to \(\Lambda_0\). Under the regularity assumptions stated in the paper, \(\sqrt n(\widehat\theta-\theta_0)\) converges weakly to a mean-zero tight Gaussian process, and practical inference is based on the bootstrap [1803.09830].

In the zero-inflated Gaussian graph problem, the covariance estimator has an elementwise sup-norm rate under assumptions bounding correlations away from \(\pm1\) and imposing a Morse condition on the population log-likelihood. Specifically, if \(n/\log n\) is large enough, then with high probability
$$
\|\widetilde\Sigma^{(n)}-\Sigma^*\|_\infty
\le
D\sqrt{\frac{\log n}{n}\log\!\left(\frac{B}{\rho}\right)}.
$$
Combined with standard graphical lasso theory under incoherence and beta-min conditions, this yields elementwise consistency of \(\widetilde\Theta^{(n)}\) and consistency of graph recovery [1911.07694].

In the Haar-matrix model, deterministic truncation and random double truncation lead to different functional limits. Deterministic truncation yields a tied-down bivariate Brownian bridge, whereas random double truncation produces, after centering and normalization by \(n^{-1/2}\),
$$
n^{-1/2}\big(T^{(n)}-\mathbb ET^{(n)}\big)
\Rightarrow
W^{(\infty)}(s,t)=B_0(t)+B_0'(s),
$$
with \(B_0\) and \(B_0'\) independent one-dimensional Brownian bridges. The matrix-driven term \(Z^{(n)}\) vanishes at the \(n^{-1/2}\) scale, so the leading fluctuations are generated by the random row and column selectors rather than by the fine dependence structure of the Haar entries [1302.6539].

## 5. Identifiability, ignorability, and structural invariance

Random double truncation is not synonymous with unavoidable correction. Under independence between \(X\) and \((U,V)\), the sampling bias is ignorable exactly when
$$
G(x)=\alpha
\quad\text{on the support of }X,
$$
equivalently \(F^*=F\), or equivalently \(\operatorname{Var}(G(X))=0\). In that case the naive empirical cdf \(F_n^*\) is consistent and fully efficient for \(F\), and under the null the NPMLE coincides with \(F_n^*\). To test this null, a Kolmogorov–Smirnov-type statistic is proposed:
$$
D_n=\sup_{x\in\mathcal S_X}|F_n(x)-F_n^*(x)|,
$$
with bootstrap approximation of its null distribution. Under the stated conditions, \(\sqrt n D_n\) converges to the supremum of a centered Gaussian process, while under fixed alternatives \(D_n\to_p \sup_x|F^*(x)-F(x)|>0\) [2301.03698].

A distinct but related misconception is that independence alone is enough to justify ordinary estimation. The survival papers make a sharper point: independence between \(X\) and \((U,V)\) is the basis of the Efron–Petrosian framework, but ordinary empirical methods are valid only when the induced sampling function is constant. Conversely, the Cox-regression paper departs from unconditional independence and instead assumes conditional independence \(T\perp(L,R)\mid Z\), showing that dependence induced by shared covariates can be accommodated without modeling the truncation distribution itself [2301.03698] [1803.09830].

The literature also identifies important existence and uniqueness issues. The NPMLE for doubly truncated data may fail to exist or be non-unique; in one formulation this is characterized through a directed graph on observed triplets, with unique NPMLE if and only if the graph is strongly connected. Severe truncation can also make the NPMLE highly variable even when it exists, which motivates semiparametric stabilization via \(G_{\hat\theta}\) [2103.14153].

In multivariate normal theory, double truncation preserves more structure than might be expected. When only a subset \(T\) of coordinates is truncated and the remaining subset \(S\) is untruncated, the inverse covariance matrix of the truncated distribution leaves unchanged the off-diagonal blocks linking truncated and untruncated variables and the block corresponding to relations within \(S\). The preservation of zero patterns in the precision matrix implies that conditional independence structure is unchanged by selection, and the stronger blockwise invariance shows that many precision elements involving untruncated variables are numerically invariant as well [1206.5387].

## 6. Empirical regimes, applications, and limitations

The applied papers show that the impact of random double truncation is highly regime-dependent. In hazard estimation, the semiparametric kernel estimator systematically attains smaller MISE than the nonparametric estimator in the reported simulations, especially for small \(n\) and narrow sampling windows, while both corrected estimators dominate the naive hazard when \(G(x)\) is not flat. In the ACS age-at-diagnosis application, the estimated sampling function is essentially flat, so naive and corrected hazard curves are similar and the main difficulty is variance and NPMLE existence. In the AIDS incubation example, the estimated \(G(x)\) is decreasing, longer incubation times are less likely to be observed, and the naive hazard lies above the corrected curves [2103.14153].

The testing paper illustrates the same distinction from a distributional perspective. In the childhood cancer interval-sampling data, the statistic is \(D_n=0.0206\) with bootstrap \(p\approx0.912\), so there is no evidence against ignorable sampling bias and the empirical cdf is substantially more efficient than the NPMLE. In the Parkinson’s disease study, the early-onset group yields \(D_n=0.2612\) with \(p=0.0520\), whereas the late-onset group yields \(D_n=0.7929\) with \(p=0.0022\), indicating strongly non-ignorable bias in the latter case [2301.03698].

In regression, the dependent-truncation EM estimator shows little bias and, in most practical situations reported in simulation, lower mean-squared error than the weighted estimators that assume unconditional independence. In the autopsy-confirmed Alzheimer’s disease cohort, the method yields statistically significant effects of age at onset, sex, and high occupational attainment, whereas the independence-based weighted analysis attenuates some of these effects [1803.09830].

In zero-inflated Gaussian graph estimation, simulations compare the pairwise truncated-likelihood plus graphical-lasso procedure with naive graphical lasso applied directly to the truncated data. The reported findings are that naive Glasso suffers lower true-edge detection and more false positives, especially when zero inflation is heterogeneous or severe, whereas the likelihood-based correction remains close to graphical lasso on the untruncated latent data in several graph families [1911.07694].

The main limitations are model-specific. The survival and testing frameworks require independence between the target variable and truncation pair, except in the Cox model where only conditional independence is assumed; violations are not handled there. The fully nonparametric survival estimators depend on NPMLE existence and can be unstable under severe truncation. The zero-inflated Gaussian method assumes latent Gaussianity, known double-truncation bounds, and incurs \(O(p^2)\) nonconvex one-dimensional optimizations. The Cox EM formulation does not straightforwardly accommodate time-varying covariates measured after study entry. The random-matrix analysis focuses on weak convergence rather than non-asymptotic concentration. These limitations indicate that “random double truncation” is not a single technique but a family of selection mechanisms whose treatment depends on whether the key object is a distribution, a hazard, a regression parameter, a covariance graph, or a stochastic process [2103.14153] [1803.09830] [1911.07694] [1302.6539].

Source: https://www.emergentmind.com/topics/random-double-truncation