Diffusion Map: A Spectral Data Representation

• Diffusion maps are a kernel-based spectral method that constructs a Markov diffusion operator from pairwise affinities to capture intrinsic data geometry.
• They embed data points using eigenvalues and eigenvectors of normalized graph Laplacians, approximating multiscale connectivity and diffusion distances.
• Practical applications include manifold learning, clustering, and accelerating computations with methods like Nyström extension and landmark diffusion maps.

A diffusion map is a kernel-based spectral construction that represents data through the eigenstructure of a Markov diffusion operator built on pairwise affinities. In its standard form, one starts from a weighted graph on samples, normalizes it into a random-walk operator, and embeds each point by coordinates of the form $$\Phi_t(x_i)=\big(\lambda_1^t\psi_1(i),\lambda_2^t\psi_2(i),\ldots,\lambda_m^t\psi_m(i)\big)$$, where the eigenvalues $\lambda_k$ and eigenvectors $\psi_k$ encode multiscale connectivity. The resulting Euclidean distance in embedding space equals, or approximates after truncation, the diffusion distance, which measures similarity through many short paths rather than raw ambient proximity. At the same time, diffusion maps are more precisely a spectral representation of intrinsic diffusion geometry than a canonical low-dimensional chart: the correct chart may lie in the span of several diffusion modes rather than in the leading coordinates themselves (Candanedo et al., 30 Mar 2026).

1. Construction of the diffusion operator

Let a dataset be given by points $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$. A standard affinity is the Gaussian kernel

$$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$

or, equivalently in some formulations, $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$. With degree matrix $D$ defined by $D_{ii}=\sum_j K_{ij}$, the basic Markov normalization is

$P=D^{-1}K,$

so that each row of $P$ sums to one. A symmetric conjugate,

$\lambda_k$0

shares eigenvalues with $\lambda_k$1 and is often preferred for stable eigendecomposition (Candanedo et al., 30 Mar 2026).

If $\lambda_k$2 with $\lambda_k$3, the diffusion map at diffusion time $\lambda_k$4 is

$\lambda_k$5

The associated diffusion distance has the spectral form

$\lambda_k$6

An equivalent probabilistic expression uses $\lambda_k$7-step transition probabilities, so diffusion distance compares how similarly two starting points spread mass through the graph. This is the core reason diffusion maps recover manifold-scale connectivity rather than merely preserving local Euclidean neighborhoods (Long et al., 2017).

2. Continuum limit and operator-theoretic meaning

A central feature of diffusion maps is that kernel normalization determines which differential operator is approximated in the sampling limit. With Coifman–Lafon anisotropic normalization,

$\lambda_k$8

different values of $\lambda_k$9 produce different limiting generators. For $\psi_k$0, sampling-density effects are removed and the construction approximates the Laplace–Beltrami operator; for $\psi_k$1, the limit is density-sensitive; and for $\psi_k$2 with $\psi_k$3, the limiting operator matches the overdamped Langevin generator up to the factor $\psi_k$4 (Trstanova et al., 2019).

This operator viewpoint makes diffusion maps a bridge between graph constructions and continuous PDEs. In one common notation, the random-walk graph Laplacian is $\psi_k$5, and if $\psi_k$6, then $\psi_k$7 with $\psi_k$8. Thus the diffusion spectrum and graph-Laplacian spectrum encode the same geometric content, expressed either as slow Markov modes or as decay rates of the semigroup (Candanedo et al., 30 Mar 2026). More generally, the diffusion operator approximates a heat semigroup on the underlying manifold, so powers of $\psi_k$9 act as discrete analogues of $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$0 (Shan et al., 2022).

An important correction to a common interpretation is that diffusion maps do not, by themselves, solve the inverse problem of selecting a low-distortion coordinate chart. On a Swiss roll with known isometric coordinates, the correct chart lies in the span of diffusion coordinates, but the leading few modes need not align with the chart variables. Isomap most efficiently recovers the low-dimensional chart, UMAP gives an intermediate tradeoff, and diffusion maps become accurate only after combining multiple diffusion modes (Candanedo et al., 30 Mar 2026).

3. Diffusion time, component relevance, and practical tuning

The diffusion time $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$1 multiplies spectral scales through $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$2, suppressing higher-frequency modes faster than lower-frequency ones. Formally, the continuum semigroup satisfies $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$3, and a discrete approximation should satisfy $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$4. This motivates the semigroup error criterion

$X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$5

with the recommended choice being the first local minimum in the useful small-to-moderate $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$6 regime rather than a late trivial minimum associated with ambient-space diffusion (Shan et al., 2022).

In practice, however, recent applied studies emphasize that $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$7 often has limited qualitative influence. On the social-science datasets examined in one study, the time parameter had no significant influence on the analysis, while discrete and redundant variables, as well as scaling and normalization, had a substantial impact (Beier, 17 Aug 2025). A practice-oriented review similarly reports that varying $X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$8 mainly rescales axes, whereas preprocessing, bandwidth, neighborhood sparsification, and component selection strongly shape the resulting manifold (Beier et al., 28 Jan 2026).

Component selection is especially delicate because the eigenspectrum need not indicate which coordinates are informative. For one-dimensional manifolds with Neumann boundary conditions, higher diffusion coordinates can be polynomial functions of lower ones, such as

$X=\{x_i\}_{i=1}^N\subset\mathbb{R}^D$9

so leading coordinates may contain redundancy rather than new geometric directions (Beier, 17 Aug 2025). To address this, one proposed criterion is the Neural Reconstruction Error,

$$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$0

which measures how well selected diffusion components reconstruct the original data through a learned decoder. The practical implication is that the first components are not necessarily the most relevant ones (Beier et al., 28 Jan 2026).

4. Scalability, out-of-sample extension, and fast approximations

Standard diffusion maps become expensive because dense kernel construction is $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$1 in memory and time, while dense eigendecomposition is $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$2 in the worst case. A classical remedy is Nyström extension. For a new point $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$3, if $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$4 denotes the normalized kernel row, then

$$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$5

and the embedding follows from the same spectral scaling (Long et al., 2017).

Several acceleration strategies have been developed. Landmark Diffusion Maps reduce out-of-sample extension from $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$6 to $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$7 per query point, with $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$8, using landmarks selected by pruned spanning trees or k-medoids; the reported gains include up to 50-fold speedups in molecular systems with less than 4% errors in manifold reconstruction fidelity relative to the full dataset (Long et al., 2017). Integrating Nyström approximation into the spectral stage itself yields roughly two- to four-fold speedups when approximating dominant diffusion-map components on datasets such as the Swiss roll and the Lorenz system (Erichson et al., 2018).

Compression can also be performed at the level of data regions rather than points. “Compressed Diffusion” replaces pointwise diffusion by region-level diffusion using an inverse-density measure-based Gaussian correlation kernel, then interpolates point embeddings from region-to-point probabilities. On the Swiss roll, this approach provided about a 10× speedup over exact diffusion maps for $$K_{ij}=\exp\!\left(-\frac{\|x_i-x_j\|^2}{\epsilon}\right),$$9 while preserving the diffusion geometry well enough for practical embedding tasks (Gigante et al., 2019). A different acceleration route is quantum: the proposed quantum diffusion map performs the eigendecomposition of the Markov transition matrix in $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$0 under qRAM and coherent-state assumptions, although the end-to-end expected runtime remains $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$1 because classical tomography dominates readout (Sornsaeng et al., 2021).

5. Generalizations and operator-learning variants

The diffusion-map framework has been generalized well beyond isotropic manifold learning. Target Measure Diffusion Maps replace the drift term tied to the sampling density by the gradient of an arbitrary density of interest $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$2, approximating

$$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$3

even when the samples themselves are drawn from a different density $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$4 (Banisch et al., 2017). Local-kernel diffusion maps go further and approximate the forward and backward generators of arbitrary non-degenerate Itô diffusions

$$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$5

with backward generator

$$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$6

where $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$7 (Banisch et al., 2017).

Another line of work replaces the manifold-only assumption by a measure-based assumption. “Diffusion Representations” uses a measure-based Gaussian correlation kernel and derives an explicit map $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$8 that preserves pairwise diffusion distances at $$k_\epsilon(x,y)=\exp\!\big(-\|x-y\|^2/(4\epsilon)\big)$$9, does not depend on data size, and for stationary data requires no out-of-sample extension for newly arrived points (Salhov et al., 2015). “Diffusion maps for changing data” considers parameter-indexed families of kernels $D$0 and defines both a dynamic diffusion distance between points across parameters and a global diffusion distance between entire graphs, together with operators that map all parameter-specific embeddings into a common space (Coifman et al., 2012).

Supervised and geometry-modifying variants also exist. Iterated Diffusion Maps estimate local derivatives of a feature map $D$1 and iteratively deform the geometry so that irrelevant directions contract while feature-aligned directions are emphasized; on product manifolds, the method converges to the quotient manifold isometric to the feature manifold (Berry et al., 2015). In graph signal processing, diffusion maps can be used as graph shift operators, with filtering and Markov Variation minimization built around operators such as $D$2 or $D$3 to improve graph learning on synthetic and temperature-sensor data (Hildebrant, 2023).

6. Applications, comparisons, and recurrent misconceptions

Diffusion maps have been used across a wide range of scientific settings. In molecular systems, they approximate generators of Langevin dynamics, identify slowly evolving principal modes, detect metastable sets, and approximate committor functions; the same operator viewpoint supports enhanced sampling through locally learned collective variables (Trstanova et al., 2019). In nonlinear filtering, a diffusion-map-based algorithm approximates the gain function in the Feedback Particle Filter by approximating the semigroup $D$4 from particles alone; the analysis separates an $D$5 bias from a finite-sample variance term of order $D$6 at the operator level (Taghvaei et al., 2019).

In applied data analysis, diffusion maps have served as a preprocessing step for clustering fMRI spatial maps extracted by ICA, where diffusion-map-based clustering worked as well as more traditional methods and produced more compact clusters when needed (Sipola et al., 2013). In generative modeling, diffusion-map particle systems use diffusion maps to approximate the Langevin generator and then construct a Laplacian-adjusted Wasserstein gradient descent sampler; on the reported synthetic and real datasets of moderate dimension, the method achieved the smallest regularized optimal-transport errors among the compared approaches (Li et al., 2023). In supervised learning, a diffusion map preceded by a supervised linear projection improved classification accuracy on Caltech-101, 15-Scenes, and human-action benchmarks relative to several baselines (Jiang et al., 2020).

Social-science case studies expose several recurring pitfalls. Analyses of the V-Dem democracy dataset, British census data, and German district statistics show that discrete variables, redundant variables, and scaling choices can dominate the embedding, whereas the time parameter $D$7 often has little qualitative effect. These studies also emphasize that, unlike PCA, the diffusion-map eigenspectrum does not provide a clear indication of which components are important (Beier, 17 Aug 2025). This reinforces a broader conceptual point: diffusion maps excel at representing intrinsic diffusion geometry and multiscale connectivity, but chart selection, component ranking, and interpretation remain separate problems. In that sense, diffusion maps are best understood not as a single-purpose dimensionality-reduction routine, but as a flexible spectral framework for learning operators, geometries, and diffusion-mediated relations on complex data (Candanedo et al., 30 Mar 2026).