HomeDocs-Technical WhitePaper25-EFT.WP.STG.Dynamics v1.0

Chapter 4 — Graph Operators and Kernels (Diffusion / Wave / Filtering)


One-Sentence Goal
Define and implement diffusion/wave/frequency-domain kernels g(L) on G = (V, E), and establish a verifiable loop that compares continuous kernels and discrete-step propagations with numerical approximations.


I. Scope and Objects

  1. Objects
    • Node operators: L = D − A, L_norm = I − D^{−1/2} A D^{−1/2}, random-walk L_rw = I − D^{−1} A.
    • Edge / first-order operators (optional): L_1 = B^T B (Hodge-1 Laplacian, reserved for interfaces).
    • Kernels & filters: K_t = exp(−t L) (diffusion), W_t = { cos(t √L), (√L)^{−1} sin(t √L) } (wave), H = g(L) (general graph filtering).
  2. Applicability
    Parallel treatment of continuous-time kernels and discrete-step propagation; multiple numerical approximations (Padé / Krylov / Chebyshev / Lanczos).
  3. Boundaries & compliance
    • unit(field) and dim(field) must be explicit; if A has units, normalize before constructing L (Ch. 2).
    • Directed/negative weights must declare variants (magnetic Laplacian / symmetrization); this chapter assumes undirected nonnegative weights.

II. Terms and Variables


III. Axioms P704-*


IV. Minimal Equations S704-*

  1. S704-1 (Diffusion kernel): K_t = exp(−t L), acting on x as x(t) = K_t x(0).
    Units: if L is dimensionless then dim(t) = "[1]"; if L has "[1/T]", declare unit(t) = "[T]" and check_dim.
  2. S704-2 (Wave kernel): W_t x = cos(t √L) x + (√L)^{−1} sin(t √L) v0, v0 = ẋ(0).
  3. S704-3 (Random-walk / de-absorption): H_α = (1−α) ( I − α D^{−1} A )^{−1} or personalized H = (1−α) ( I − α P )^{−1}, P = D^{−1} A.
  4. S704-4 (General graph filtering): y = g(L) x, e.g., g(λ) = exp(−t λ), (1 + β λ)^{−p}, band-pass g(λ) = exp( − ( (log λ − μ)^2 / (2 σ^2) ) ) on (0, λ_max].
  5. S704-5 (Chebyshev approximation): scale spectrum to [-1, 1], \tilde{L} = (2 L / λ_max) − I,
    g(L) x ≈ Σ_{m=0}^{M} c_m T_m(\tilde{L}) x, with T_m Chebyshev polynomials and c_m from ( ∫_{−1}^{1} g(•) T_m(•) dμ ).
  6. S704-6 (Lanczos/Krylov approximation): on K_m(L, x) = span{ x, Lx, …, L^{m−1} x },
    g(L) x ≈ || x || Q_m g(T_m) e_1, where Q_m^T L Q_m = T_m (tridiagonal).
  7. S704-7 (Dual-form gaps):
    • Continuous vs discrete: delta_form_kernel = || K_{K Δt} x − ( I − Δt L )^K x ||_2.
    • True vs approximate: ε_approx = || g(L) − \hat{g}_M(L) ||_2.
  8. S704-8 (Energy & monotonicity): diffusion energy E(t) = (1/2) x(t)^T L x(t) satisfies dE/dt = − || ∇_G x ||^2 ≤ 0; discretely, E_{k+1} ≤ E_k.

V. Metrology Workflow M7-4 (Ready → Model → Check → Persist)

  1. Ready
    Load L and estimate λ_max; for Chebyshev, build \tilde{L}; finalize RefCond and unit system.
  2. Model / Approximate
    • Choose kernel family g (diffusion / wave / de-absorption / band-pass) and parameters { t, α, β, p, μ, σ }.
    • Choose approximator (Padé / Krylov / Chebyshev / Lanczos) and order M or subspace size m.
  3. Checks
    • Sample S vectors x_s and evaluate ε_approx(s) = || g(L) x_s − \hat{g}(L) x_s || / || x_s ||; report percentiles.
    • Compute dual-form delta_form_kernel; test diffusion energy monotonicity and semigroup contraction.
    • For random-walk kernels, verify row-stochasticity: row_sum(H) ≈ 1 and nonnegativity.
  4. Persist / Publish
    manifest.stg.kernel = { type: g, params, approx: { method, M|m }, λ_max, eps_p95, delta_form_p95, energy_test, RefCond, seed, method.hash }.

VI. Contracts & Assertions C70-4xx


VII. Implementation Bindings I70-4*

Invariants: sym(L); λ_i ≥ 0; contraction/conservation contracts pass; delta_form_kernel ≤ tol_Tarr_kernel; traceable RefCond/method/params.


VIII. Cross-References


IX. Quality & Risk Control


Summary
This chapter unifies graph operators and kernels on STGs: definitions of g(L), diffusion/wave/de-absorption kernels, continuous–discrete dual-form comparisons, and error metrics. It provides the M7-4 workflow, C70-4xx contracts, and I70-4* interfaces. Key outputs: manifest.stg.kernel.* (kernel type, parameters, approximation method, errors & contract outcomes) serving operator-level dependencies for identification, control, and runtime publication.


Copyright & License (CC BY 4.0)

Copyright: Unless otherwise noted, the copyright of “Energy Filament Theory” (text, charts, illustrations, symbols, and formulas) belongs to the author “Guanglin Tu”.
License: This work is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0). You may copy, redistribute, excerpt, adapt, and share for commercial or non‑commercial purposes with proper attribution.
Suggested attribution: Author: “Guanglin Tu”; Work: “Energy Filament Theory”; Source: energyfilament.org; License: CC BY 4.0.

First published: 2025-11-11|Current version:v5.1
License link:https://creativecommons.org/licenses/by/4.0/