---
title: Local Asymptotic Normality (LAN) Property
url: https://www.emergentmind.com/topics/local-asymptotic-normality-lan-property
type: topic
---

# Local Asymptotic Normality (LAN) Property

Local Asymptotic Normality (LAN) property is a fundamental conceptual and technical cornerstone in modern asymptotic statistics, characterizing when a statistical family of probability measures, under regular local perturbations of a parameter, admits a quadratic (Gaussian) approximation to the log-likelihood. This enables rigorous derivation of asymptotic minimax bounds, sharp efficiency results, and deep connections to the theory of optimal estimation in complex models such as stochastic differential equations, jump processes, high-frequency observations, and infinite-dimensional settings.

## 1. Formal Definition and Structural Essence

Let $\{\mathbb{P}_\theta^{(n)}: \theta\in\Theta\subset\mathbb{R}^d\}$ be a family of probability measures on a sequence of measurable spaces $(\mathcal{X}_n,\mathcal{F}_n)$. The LAN property at a fixed $\theta_0$ requires the existence of a rate matrix $r_n(\theta_0)\in\mathbb{R}^{d\times d}$ and a positive-definite (or at least non-degenerate) Fisher information matrix $I(\theta_0)$, such that, for each fixed $h\in\mathbb{R}^d$,
\[
\log\frac{d\mathbb{P}_{\theta_0 + r_n(\theta_0) h}^{(n)}}{d\mathbb{P}_{\theta_0}^{(n)}}(X^n)
= h^\top \Delta_n(\theta_0) - \frac{1}{2} h^\top I(\theta_0) h + o_{P_{\theta_0}}(1), 
\]
where $\Delta_n(\theta_0)\xrightarrow{d}N(0,I(\theta_0))$ under $P_{\theta_0}^{(n)}$ as $n\to\infty$ [1304.7662], [1506.00776], [1610.03694], [2510.17233], [2512.24042]. The precise scaling in $r_n$ and the limiting $I(\theta_0)$ depend on the stochastic model and asymptotic regime.

## 2. LAN in SDEs, Driven Diffusions, and Models with Jumps

LAN characterizations have been established for a wide array of continuous and discrete-time stochastic processes, including ergodic diffusions [1506.00776], diffusions with jumps or jump-diffusions [1304.7662], fractional noise models [1610.03694, 2510.17233, 2512.24042, 1509.00003, 1804.04108], and high-frequency sampled models with infinite activity jumps [1411.1516].

A canonical example is for an SDE with jumps, observed at high frequency:
\[
dX_t = b(\theta, X_t)dt + \sigma(X_t)dB_t + \int_{\mathbb{R}^d}c(X_{t-},z) \tilde{N}(dt,dz),
\]
with the log-likelihood expansion under local alternatives $\theta_n = \theta_0 + u/(\sqrt{n\Delta_n})$:
\[
\log \frac{dP_{\theta_n}^{(n)}}{dP_{\theta_0}^{(n)}} = u^T S_n - \frac{1}{2} u^T I(\theta_0) u + o_P(1),
\]
where $S_n$ is a properly normalized score vector arising from the increments, and $I(\theta_0)=E_{\pi_{\theta_0}}[(\partial_\theta b(\theta_0,X))^T \sigma(X)^{-2} \partial_\theta b(\theta_0,X)]$ [1506.00776].

In the jump-diffusion framework:
\[
dX_t = b(\theta, X_{t-})dt + \sigma(\theta, X_{t-})dW_t + \int_Z c(\theta, X_{t-},z)(\mu(dt,dz) - \nu(dz)dt),
\]
under regularity, one obtains a pathwise LAN expansion with the Fisher information matrix structured in terms of both continuous and jump components [1304.7662].

Jump-driven Lévy processes exhibiting local $\alpha$-stable behavior require nontrivial rate matrices—potentially non-diagonal if the process is asymmetric—reflecting collinearities in the likelihood expansion [1411.1516].

## 3. High-Frequency and Semiparametric LAN: Rates, Non-Diagonality, and Information Structure

In high-frequency sampled models (e.g., fractional Brownian motion, mixed fBM, and fractional Gaussian noise), the score components for different parameters (e.g., volatility $\sigma$ and Hurst index $H$) are often asymptotically collinear, necessitating non-diagonal rate matrices in the LAN expansion to achieve non-degenerate normal limits [1610.03694], [2512.24042]. For mixed fBM, the central sequence must be constructed via an orthogonalization (lower-triangular) transform to ensure invertibility of the Fisher information matrix and efficiency of the LAN property [2512.24042].

For infinite-dimensional (nonparametric) diffusions, as in reflected scalar diffusions with unknown drift in $C^1$, the LAN property is realized in terms of abstract Hilbert space operators. The LAN norm and information operator are defined via the score operator $A_b$ and its adjoint $A_b^*$, and the limit experiment corresponds to a Gaussian shift in Hilbert space [1802.02009].

| Model Type           | Scaling ($r_n$)               | Key Feature                     |
|----------------------|-------------------------------|----------------------------------|
| Ergodic diffusion    | $(n\Delta_n)^{-1/2}$          | Standard rate if full obs.       |
| fBM/fGn (high-freq)  | Non-diagonal $R_n$, dependent on $H$ | Collinearity of scores, phase transition at $H=1/2,3/4$ |
| Jump models (Lévy)   | Matrix with off-diagonal terms | Asymmetry and drift-skew interaction  |
| SDE with periodicity | $\text{diag}(n^{-1/2}, n^{-3/2})$ (shape, period) | Mixed rates, Fisher matrix block structure   |

## 4. LAN in Fractional and Mixed Fractional Models

In models with fractional noise, including SDEs driven by $B^H$ ($H\neq1/2$), or mixed processes $Y_t=\sigma B^H_t + W_t$, the LAN property can be established, but parameter identification and minimax bounds depend heavily on the interplay of sample frequency, the value of $H$, and the influence of the white noise [1610.03694], [2512.24042].

In particular, for mixed fractional OU processes with $H>3/4$, the process is a semimartingale and the likelihood can be handled via an explicit innovation decomposition using Volterra equation resolvents [2510.17233]. The Fisher information matrix is then explicitly computable via spectral integrals involving the derivative of the log spectral density.

Degeneracy in the Fisher matrix (as $H\uparrow3/4$ or for small $H$) leads to a need for careful orthogonalization of central sequences, as certain directions in parameter space become unidentifiable or nearly collinear at the LAN scale [2512.24042].

## 5. Statistical Implications: Minimax Bounds, Efficiency, and Limit Experiments

LAN forms the theoretical foundation for sharp asymptotic lower bounds, optimality, and the structure of limiting statistical experiments. Once LAN holds, the experimental sequence is locally asymptotically equivalent to a Gaussian shift: any estimator sequence $\hat\theta_n$ satisfies
\[
\sqrt{n\,\text{(rate)}} (\hat\theta_n - \theta_0) \Longrightarrow N(0, I(\theta_0)^{-1}),
\]
with the maximum likelihood estimator (MLE) being asymptotically efficient [1304.7662], [1506.00776], [1509.00003], [2512.24042], [2510.17233].

Minimax lower bounds (Hájek–Le Cam theorem) follow directly, formally characterizing the (lower) bound for any regular estimator's risk as the risk of estimation in a Gaussian shift with the same information. Contiguity of the shifted experiments (mutual absolute continuity in the LAN expansion) is pivotal for local minmax theory [2512.24042].

In specialized settings (multi-armed bandits, [2512.12192]; mean-field interactions in McKean-Vlasov SDEs, [2205.05932], [2511.13366]), the LAN property holds under specific regularity and identifiability conditions, with explicit block or composite forms for the Fisher information reflecting adaptive or interacting sampling designs.

## 6. Advanced Extensions: Mixed Normality, Cubic Approximations, and Monte Carlo

Beyond classical LAN, one encounters local asymptotic mixed normality (LAMN) for models with random/degenerate limiting information (especially in non-ergodic cases or under partial observation) [2005.14599], [1304.7662]. Here, the limit experiment is a family of mixed (Gaussian with random covariance) shifts, quantified precisely by random Fisher information.

Recent advances include "Rescaled Local Asymptotic Normality" (RLAN), which expands the asymptotic quadratic approximation to hold on larger, $n^{-1/4}$ neighborhoods, allowing for efficient cubic-maximum-likelihood estimation, and statistical efficiency even under scaling Monte Carlo error [2007.00723]. The RLAN extension requires strong smoothness and moment bounds, but provides tools for valid estimation using noisy, simulation-based log-likelihood computations.

## 7. Methodological Tools and Proof Techniques

The establishment and verification of the LAN property relies on advanced techniques:

- **Girsanov Theorem:** Crucial for constructing likelihood ratios in models with drift-parameter perturbations for both standard and fractional diffusions [1506.07270], [1509.00003], [2510.17233].
- **Malliavin Calculus:** Essential for handling models with jumps or degenerate noise, yielding explicit score representations via Skorohod integrals and validating differentiability of transition densities [1506.00776], [1506.07270], [2005.14599], [2511.13366].
- **Quadratic Mean Differentiability:** Underpins provision of expansion rates and information matrices in general Markov and semimartingale settings [1304.7662], [2205.05932].
- **Martingale Central Limit Theorem:** Used throughout for proving convergence in law of score vectors in both i.i.d. and dependent/Markovian data [2510.17233], [1506.00776], [1610.04093].
- **Spectral and Toeplitz-Circulant Methods:** Deployed in models with long-memory/Toeplitz covariance (e.g., fGn, mixed fBM), to compute relevant variances and ensure the LAN norm is well-posed [1610.03694], [2512.24042].
- **Ergodic Theorems:** Justify convergence of empirical (information) matrices to their deterministic (Fisher) limits [1506.00776], [2510.17233].

These technical developments underpin contemporary statistical inference for stochastic dynamical systems, clarify phase transitions in estimation rates, and support efficiency in the broad realm of stochastic models.

Source: https://www.emergentmind.com/topics/local-asymptotic-normality-lan-property