Pith. sign in

REVIEW 3 major objections 6 minor 44 references

Tight Wavelet Frames on Graphs via Isometric Group Embedding

T0 review · 3 major / 6 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Embedding a graph into a finite abelian Cayley graph turns its wavelet analysis into an exact Parseval tight frame with inversion-free reconstruction.

desk verdict Clean tight-frame theorem and a nice harmonic-completion result, but the abstract overstates localization and speed; worthy of peer review with a scope-focused revision. read the letter →

arxiv 2607.14168 v1 pith:OWUQZSID submitted 2026-07-15 eess.SP

Rigobert Fokam Souop , Laurent Bitjoka This is my paper · ORCID
classification eess.SP MSC 05C2505C5042C1542C4043A25
keywords graphsignalprocessingtightwaveletframesParsevalCayleygraphsisometricembeddingfiniteabeliangroupsFouriertransformharmonicextension
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that graph signals can be analyzed and reconstructed exactly, without inverting a frame operator, once the graph is isometrically embedded into a Cayley graph of a finite abelian group. On that host the group characters form a canonical Fourier basis, and a normalized filter bank in the frequency magnitude makes the wavelet family a Parseval tight frame by construction. The authors prove exact reconstruction by restriction, a multiresolution decomposition, an O(JN log N) fast transform via the host FFT, and an optimal harmonic completion of a signal to the host remainder. A sympathetic reader would care because this replaces the non-canonical, basis-ambiguous eigenbasis of spectral graph wavelets with the classical exact Fourier analysis of a finite group, and makes reconstruction a direct adjoint operation rather than a linear solve.

What carries the argument

The machinery is the isometric embedding of G into a finite abelian Cayley graph Γ, together with the normalized spectral filter bank. The characters of Γ provide a canonical orthonormal Fourier basis with no eigenspace ambiguity; translation acts as exact modulation, and the normalization Σ_j |ψ̂_j(k)|^2 = 1 converts a filter bank into a Parseval tight frame. The lift-restriction pair (L, R) with RL = Id transfers exactness from the host back to the graph, while the frequency magnitude |k| orders characters from smooth to oscillatory.

What would settle it

Compute the frame-bound ratio B/A of the normalized filter bank on the minimal abelian host of any graph with a proper embedding, for example the star, diamond, or Petersen examples; any value different from 1.000 would falsify Theorem 1.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1: for any connected graph G with an isometric embedding into a Cayley graph of a finite abelian group Γ, the normalized filter bank {g_j(k) = g_j(|k|) / sqrt(Σ_i g_i(|k|)^2)} defines wavelets ψ_{j,h} whose translates form a Parseval frame for C^Γ, so every graph signal s satisfies s = R(Σ_{j,h} ⟨Ls, ψ_{j,h}⟩ ψ_{j,h}) with no frame-operator inversion. The reason is a partition of unity in the frequency variable: Σ_j |ψ̂_j(k)|^2 = 1. The same construction gives a multiresolution decomposition (Theorem 3), O(JN log N) complexity via the host FFT (Theorem 4), and, for proper embeddings, a unique harmonic extension that minimizes host Dirichlet energy (Theorem 5).

Load-bearing premise

The practical promises of speed and sharp localization depend on the minimal abelian Cayley host being compact — meaning N = O(|V|); for generic graphs the host can be binary and exponential in |V|, leaving the frame exact but neither fast nor localized.

Editorial extensions

If this is right

  • On any graph whose minimal abelian Cayley host is compact (N = O(|V|)), the transform runs in O(JN log N) and reconstructs any signal to machine precision with no iterative solve.
  • The frame is exactly tight on the canonical character basis, so analysis and synthesis are adjoint operations; the multiresolution bands occupy disjoint frequency supports and sum exactly to the signal.
  • On graphs that are themselves abelian Cayley graphs (excursion ratio 1), the construction reduces to classical periodic or toral wavelet analysis.
  • For proper embeddings, the unambiguous way to fill the host complement is the discrete harmonic extension, which uniquely minimizes host Dirichlet energy; zero-padding and symmetric extension are approximations of it.
  • Compared with a spectral Laplacian-eigenbasis construction on the same cycle, this construction has frame-bound ratio 1.000 and machine-precision reconstruction, whereas the spectral construction is non-tight and requires frame-operator inversion.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper, the same substrate suggests a practical selection rule: apply the group-embedding transform when the excursion ratio is bounded below, and reserve spectral methods for generic graphs; the paper states the dichotomy but stops short of a decision procedure.
  • If the paper's conditioning conjecture on L_II (polylogarithmic in N) holds, the harmonic completion stays fast on structured hosts, making the whole pipeline practical at intermediate scales; this is an inference, since the paper only conjectures it.
  • A natural testable extension is a near-isometric relaxation: if embeddings that are only approximately isometric still give near-Parseval frames, the method could apply to graphs whose exact minimal host is astronomically large; the paper lists this as open future work.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes a construction of tight wavelet frames on graphs by embedding the graph isometrically into a Cayley graph of a finite abelian group (the host), defining wavelets on the host via a normalized spectral filter bank in the dual frequency magnitude, and restricting them to the graph. The main theorem (Theorem 1) states that the normalized filter bank yields a Parseval tight frame for the host, hence exact reconstruction of graph signals by restriction, with no frame-operator inversion. The paper also gives a multiresolution decomposition (Theorem 3), an O(JN log N) fast transform via the host FFT (Theorem 4), and a unique harmonic completion of graph signals to the host complement that minimizes host Dirichlet energy (Theorem 5). Numerical experiments on rings, grids, and small proper embeddings report machine-precision reconstruction and high energy concentration of band-pass atoms, while Section 9 and the remarks delineate the regime of applicability via the excursion ratio epsilon.

Significance. If the central claims hold, this is a clean and potentially useful construction: it transfers exact tightness, canonical Fourier basis, and translation covariance from finite abelian groups to arbitrary graphs that admit compact isometric embeddings, and it avoids frame-operator inversion. The proofs of Theorem 1 and Theorem 5 are mathematically sound and the numerical experiments verify the stated identities to machine precision. The paper is honest in its later sections about the conditional nature of speed and localization, and the excursion-ratio dichotomy is a clarifying contribution. However, the abstract and contribution (iii) overstate the universality of joint localization and of the O(JN log N) cost, presenting them as properties of the general construction when they are properties of specific Gaussian kernels on compact hosts. This overstatement directly affects the practical significance of the method and must be corrected before the paper can be accepted.

major comments (3)
  1. [Abstract and Section 4, Proposition 1 / Remark 2] The abstract and contribution (iii) claim that the band-pass wavelets 'localize jointly in vertex and frequency' as a general property. The paper only proves frequency support and translation covariance (Proposition 1). Spatial localization is not a consequence of the normalized filter bank construction: Definition 5 allows arbitrary nonnegative kernels, and Theorem 1 holds for any kernel family satisfying the partition of unity. For instance, indicator passbands on Z_N form a valid normalized frame, yet their atoms are Dirichlet-like and not concentrated near their centers. Section 4 itself states 'Spatial localization does not hold on an arbitrary host' and Remark 2 concedes degradation on binary hosts. Thus the abstract's unqualified localization claim is internally inconsistent with the body. The claim should be scoped to specific kernels (e.g., Gaussian kernels on compact low-dimens
  2. [Abstract and Theorem 4 / Remark 3] The abstract states the full transform costs O(JN log N) without qualification. Theorem 4 is correct only if N = |Γ| is polynomial in the input size n = |V|. The paper's own Theorem 8 and Remarks 2/3 and Section 9 show that for generic graphs the minimal host can be binary of order up to 2^{n-1}, in which case the transform is neither fast nor localized. Stating O(JN log N) as an unconditional headline property is misleading: the cost in terms of graph size is exponential for a large class of inputs. The abstract and Section 6 should state the excursion-ratio condition under which the complexity bound is useful.
  3. [Section 4, 'Spatial localization does not hold...'] The text says that band-limited functions on cyclic/toral hosts are spatially concentrated 'by the discrete uncertainty principle', citing Donoho–Stark and Perraudin et al. A discrete uncertainty principle gives a trade-off between support sizes in vertex and frequency domains, but it does not imply that a band-limited atom has most of its energy within graph distance two of its center. The empirical observation (Observation 2) measures concentration for Gaussian kernels, but the text appears to present this as a consequence of the uncertainty principle. This should be rewritten to avoid implying a theorem that is not proved, and the empirical nature of the localization measurements should be explicit.
minor comments (6)
  1. [Section 2, Definition 3] The definition of |k| as 'word length of k on the dual generating set' is informal; the formula is given but the connection to the dual generating set should be made explicit, since it determines the frequency ordering used in Definition 5.
  2. [Section 3, Definition 5] The kernels g_j are defined on [0, |k|_max], but |k|_max is not defined. It would help to state |k|_max = max_{k in Γ_hat} |k|.
  3. [Section 4, Empirical Observation 2] This is an experimental result, not an 'observation' in the mathematical sense. Rename it 'Experiment 2' or 'Measured localization' to avoid confusion.
  4. [Section 7, Proposition 2] The phrase 'each application of L_Γ costs O(N log N) via the host FFT' is correct for the full Laplacian on the group, but the conjugate-gradient solve involves L_II, not L_Γ. The text clarifies this, but the first sentence may mislead; consider a small rewrite.
  5. [Section 8.3, Figure 6 caption] The caption says 'torus 254 × 254' and '= 0.254', but the notation for epsilon is not introduced in the caption. It would be clearer to state epsilon = |V|/|Γ| = 16384/64516.
  6. [General] There are occasional typographical issues (e.g., 'host 64' in Figure 3 caption, 'via restriction' in the abstract) that should be corrected in a final polish.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular reduction: the tight-frame identity is engineered by construction, and the only self-citation dependency concerns embedding compactness rather than the main theorem.

full rationale

The central derivation is self-contained and not circular. Definition 5 normalizes the filter bank so that sum_j |ψ̂_j(k)|^2 = 1, and Theorem 1 follows immediately by Plancherel; no fitted parameter, data subset, or empirical quantity is used to derive the Parseval identity or the exact reconstruction formula. The multiresolution decomposition (Theorem 3), fast transform (Theorem 4), and harmonic completion (Theorem 5) are likewise direct mathematical consequences of the definitions and standard linear algebra, not reductions of conclusions to inputs. The isometric-embedding premise is partly delegated to the authors' companion works [18,19,20], but Section 11 supplies a self-contained proof sketch for existence and the host bound via the all-singleton partition, so the construction does not rest on a bare self-citation. The compactness/minimal-host refinements and the frozen implementation are cited from the same authors, which is a reproducibility and verification dependency rather than a circular step. The paper's joint-localization claim is explicitly empirical (Observation 2) and is carefully qualified in Remarks 2 and 3 and Section 9; absence of a general proof is a rigor issue, not circularity. Overall, no 'prediction' is statistically forced by a fitted input, and no load-bearing equation is equivalent to its own input by construction.

Assumptions & free parameters 3 free parameters · 4 assumptions · 1 invented entities

The wavelet frame theorem is self-contained and parameter-free; the embedding existence, host compactness, and numerical code are imported from the authors' companion works, and the wavelet kernels are hand-selected rather than fitted.

free parameters (3)
  • Gaussian band-pass kernel parameters = not specified numerically; J = 4 or 5
    Chosen by hand to tile the frequency axis; the tight-frame identity is invariant to them, but localization measurements and multiresolution appearance depend on their centers and widths.
  • number of scales J = 4 (5 in one experiment)
    A user-selected decomposition depth; controls cost and detail granularity, not fitted to data.
  • host group Γ and generating set S = varies per benchmark: Z_16, Z_2^10, Z_2^3, Z_2×Z_3, Z_2^4, Z_254^2
    The wavelet theorem holds for any isometric embedding, so the host is an input choice made by the companion embedding algorithm; the practical speed and localization depend directly on this choice.
assumptions (4)
  • standard math Characters of a finite abelian group form an orthonormal basis and the Fourier matrix is unitary (Plancherel).
    Used in Definitions 3-4 and in the proof of Theorem 1.
  • standard math Cayley graphs of finite abelian groups are vertex-transitive, their metric is translation invariant, and the group characters diagonalize the host Laplacian.
    Used throughout Sections 2, 3 and 7 to justify translation, convolution, and the Dirichlet energy computation.
  • domain assumption Every connected graph admits an isometric embedding into a Cayley graph of a finite abelian group, and the construction can be made compact.
    Assumed from the authors' companion works [18,19,20]; the Appendix summarizes Theorem 8 but the full proof is external to this manuscript.
  • domain assumption The minimal host order satisfies ν(G) ≥ max(n, 2 diam(G)), with equality iff G is an abelian Cayley graph.
    Theorem 10 is quoted from companion [20]; it underpins the excursion-ratio interpretation and the ε ≈ 1/ε → 0 dichotomy.
invented entities (1)
  • Excursion ratio ε = |V| / |Γ|
    purpose: Single-number measure of how close a graph is to abelian symmetry and how fast and localized the transform will be.
    A derived descriptive statistic, not a falsifiable prediction; it usefully delimits the regime but carries no independent evidence outside the embedding construction.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Tight Wavelet Frames on Graphs via Isometric Group Embedding." pith.science (2026). https://pith.science/paper/OWUQZSID

@misc{pith2026260714168,
  author       = {Pith},
  title        = {Pith review of: Tight Wavelet Frames on Graphs via Isometric Group Embedding},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OWUQZSID}},
  note         = {Machine review of arXiv:2607.14168}
}
read the original abstract

Spectral graph wavelets apply a kernel to the graph Laplacian spectrum. On an irregular graph their analyzing functions inherit a non-canonical eigenbasis, they do not form a tight frame, and reconstruction requires inverting a frame operator. We take a different route, built on an exact substrate. Given an isometric embedding of a connected graph into a Cayley graph of a finite abelian group, a host on which classical Fourier analysis applies exactly, we construct wavelets on the host and restrict them to the graph. Two constructions arise and we keep them separate. Dilation wavelets use a group automorphism as a dilation, reproducing the classical translate-dilate template but existing only on hosts with composite cyclic factors. Spectral band-pass wavelets use a normalized filter bank in the dual frequency magnitude; they exist on every host, form a Parseval (tight) frame, reconstruct any graph signal exactly via restriction, are translation-covariant, and localize jointly in vertex and frequency. We prove the tight-frame identity and exact reconstruction, give a multiresolution decomposition, and show the full transform costs O(JN log N) via the host fast Fourier transform. For a proper embedding we show the canonical way to complete a signal onto the host remainder is the discrete harmonic extension, which uniquely minimizes the host Dirichlet energy and places the zero-padding and symmetric-extension heuristics as approximations of it. On benchmark hosts reconstruction reaches machine precision and band-pass atoms concentrate 89-99 percent of their energy within graph-distance two of their center.

Figures

Figures reproduced from arXiv: 2607.14168 by the authors.

Figure 1
Figure 1. A normalized wavelet filter bank on the host [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Spectral wavelet atoms on C32 centered at vertex 0, at three scales. Fine-scale atoms (left) are sharply localized; coarse-scale atoms (right) spread while remaining cen￾tered. These are canonical and translation-covariant, unlike the eigenvector-based atoms of a generic graph. is the standard rewriting of analysis against a translated family. Spatial localization does not hold on an arbitrary host: an arbitrary com… view at source ↗
Figure 3
Figure 3. Multiresolution decomposition on C64 of a signal that is low-frequency on the first half of the ring and high-frequency on the second. The approximation captures the trend; the detail bands isolate the high-frequency burst and localize it to the correct half— joint vertex–frequency analysis computed by the host FFT. 7. The host completion: optimal extension to the complement When the embedding is proper (ε < 1) the … view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Two-dimensional spectral wavelet atoms on the [PITH_FULL_IMAGE:figures/full_fig_p012_4.png]
Figure 5
Figure 5. Figure 5: Left: mean host Dirichlet energy of the three admissible completions on each proper host. The harmonic extension (green) is the minimum on every host and in every trial, as Theorem 5 guarantees; on these small symmetric hosts it is visually indistinguish￾able from symm…
Figure 6
Figure 6. Figure 6: GE-GWT multiresolution decomposition of the standard cameraman image [PITH_FULL_IMAGE:figures/full_fig_p019_6.png]
Figure 7
Figure 7. Figure 7: Left: head-to-head on the ring C64 (both transforms run on the same signal). The group-embedding construction (ours; the legend label GE-GFT marks that tightness is engineered at the group-Fourier-transform filter-bank level, the GE-GWT being the wavelet transform buil…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

44 extracted references · 4 linked inside Pith

  1. [1]

    D. K. Hammond, P. Vandergheynst, R. Gribonval, Wavelets on graphs via spectral graph theory,Appl. Comput. Harmon. Anal.30(2) (2011) 129–150

    2011

  2. [2]

    D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, P. Vandergheynst, The emerging field of signal processing on graphs,IEEE Signal Process. Mag.30 (3) (2013) 83–98

    2013

  3. [3]

    Sandryhaila, J

    A. Sandryhaila, J. M. F. Moura, Discrete signal processing on graphs,IEEE Trans. Signal Process.61(7) (2013) 1644–1656. 27

    2013

  4. [4]

    Ortega, P

    A. Ortega, P. Frossard, J. Kovačević, J. M. F. Moura, P. Vandergheynst, Graph signal processing: overview, challenges, and applications,Proc. IEEE 106(5) (2018) 808–828

    2018

  5. [5]

    R. R. Coifman, M. Maggioni, Diffusion wavelets,Appl. Comput. Harmon. Anal.21(1) (2006) 53–94

    2006

  6. [6]

    Crovella, E

    M. Crovella, E. Kolaczyk, Graph wavelets for spatial traffic analysis, in:Proc. IEEE INFOCOM, 2003, pp. 1848–1857

    2003

  7. [7]

    S. K. Narang, A. Ortega, Perfect reconstruction two-channel wavelet filter banks for graph structured data,IEEE Trans. Signal Process.60(6) (2012) 2786–2799

    2012

  8. [8]

    X. Shi, J. M. F. Moura, Graph signal processing: modulation, convolution, and sampling, arXiv:1912.06762 (2019)

    arXiv 1912

Show all 44 references
  1. [9]

    D. L. Donoho, P. B. Stark, Uncertainty principles and signal recovery,SIAM J. Appl. Math.49(3) (1989) 906–931

    1989

  2. [10]

    Mallat,A Wavelet Tour of Signal Processing: The Sparse Way, 3rd ed., Academic Press, 2009

    S. Mallat,A Wavelet Tour of Signal Processing: The Sparse Way, 3rd ed., Academic Press, 2009

    2009

  3. [11]

    Daubechies,Ten Lectures on Wavelets, SIAM, 1992

    I. Daubechies,Ten Lectures on Wavelets, SIAM, 1992

    1992

  4. [12]

    Christensen,An Introduction to Frames and Riesz Bases, 2nd ed., Birkhäuser, 2016

    O. Christensen,An Introduction to Frames and Riesz Bases, 2nd ed., Birkhäuser, 2016

    2016

  5. [13]

    Terras,Fourier Analysis on Finite Groups and Applications, Cambridge University Press, 1999

    A. Terras,Fourier Analysis on Finite Groups and Applications, Cambridge University Press, 1999

    1999

  6. [14]

    Rudin,Fourier Analysis on Groups, Interscience, 1962

    W. Rudin,Fourier Analysis on Groups, Interscience, 1962

    1962

  7. [15]

    Godsil, G

    C. Godsil, G. Royle,Algebraic Graph Theory, Springer, 2001

    2001

  8. [16]

    Defferrard, X

    M. Defferrard, X. Bresson, P. Vandergheynst, Convolutional neural networks on graphs with fast localized spectral filtering, in:Adv. Neural Inf. Process. Syst. (NeurIPS), 2016, pp. 3844–3852

    2016

  9. [17]

    Tremblay, P

    N. Tremblay, P. Borgnat, Graph wavelets for multiscale community mining, IEEE Trans. Signal Process.62(20) (2014) 5227–5239. 28

    2014

  10. [18]

    Fokam Souop and L

    R. Fokam Souop and L. Bitjoka,Minimal Isometric Embeddings of Graphs into Abelian Groups: Theory, Algorithms, and Applications to Signal Pro- cessing over Networks, Ph.D. dissertation, University of Ngaoundéré, 2026; arXiv:2606.29391 [math.CO]

    2026 arXiv

  11. [19]

    Minimal isometric embeddings of graphs into Cayley graphs of finite abelian groups,

    R. Fokam Souop and L. Bitjoka, “Minimal isometric embeddings of graphs into Cayley graphs of finite abelian groups,” arXiv:2607.07939 [math.CO]

    arXiv

  12. [20]

    Dimension and order bounds for isometric embeddings of graphs into abelian Cayley graphs, and the abelian dividend,

    R. Fokam Souop and L. Bitjoka, “Dimension and order bounds for isometric embeddings of graphs into abelian Cayley graphs, and the abelian dividend,” arXiv:2607.07920 [math.CO]

    arXiv

  13. [21]

    Harmonic analysis on graphs via isometric group embedding: a canonical Fourier transform, shift, and convolution for network signals,

    R. Fokam Souop and L. Bitjoka, “Harmonic analysis on graphs via isometric group embedding: a canonical Fourier transform, shift, and convolution for network signals,” companion manuscript, submitted toIEEE Trans. Signal Inf. Process. Netw., 2026

    2026

  14. [22]

    Sandryhaila, J

    A. Sandryhaila, J. M. F. Moura, Discrete signal processing on graphs: fre- quency analysis,IEEE Trans. Signal Process.62(12) (2014) 3042–3054

    2014

  15. [23]

    Signal Process.65(13) (2017) 3462–3477

    N.Perraudin, P.Vandergheynst, Stationarysignalprocessingongraphs,IEEE Trans. Signal Process.65(13) (2017) 3462–3477

    2017

  16. [24]

    D. K. Hammond, P. Vandergheynst, R. Gribonval, The spectral graph wavelet transform: fundamental theory and fast computation, in:Vertex-Frequency Analysis of Graph Signals, Springer, 2019, pp. 141–175

    2019

  17. [25]

    Leonardi, D

    N. Leonardi, D. Van De Ville, Tight wavelet frames on multislice graphs, IEEE Trans. Signal Process.61(13) (2013) 3357–3367

    2013

  18. [26]

    Behjat, U

    H. Behjat, U. Richter, D. Van De Ville, L. Sörnmo, Signal-adapted tight frames on graphs,IEEE Trans. Signal Process.64(22) (2016) 6017–6029

    2016

  19. [27]

    D. I. Shuman, C. Wiesmeyr, N. Holighaus, P. Vandergheynst, Spectrum- adapted tight graph wavelet and vertex-frequency frames,IEEE Trans. Signal Process.63(16) (2015) 4223–4235

    2015

  20. [28]

    D. B. Tay, Y. Tanaka, A. Sakiyama, Almost tight spectral graph wavelets with polynomial filters,IEEE J. Sel. Topics Signal Process.11(6) (2017) 812–824

    2017

  21. [29]

    Dong, Sparse representation on graphs by tight wavelet frames and appli- cations,Appl

    B. Dong, Sparse representation on graphs by tight wavelet frames and appli- cations,Appl. Comput. Harmon. Anal.42(3) (2017) 452–479. 29

    2017

  22. [30]

    Nakahira, A

    K. Nakahira, A. Miyamoto, Parseval wavelets on hierarchical graphs,Appl. Comput. Harmon. Anal.44(2) (2018) 414–445

    2018

  23. [31]

    Göbel, G

    F. Göbel, G. Blanchard, U. von Luxburg, Construction of tight frames on graphs and application to denoising, in:Handbook of Big Data Analytics, Springer, 2018, pp. 503–522

    2018

  24. [32]

    Ghandehari, D

    M. Ghandehari, D. Guillot, K. Hollingsworth, Gabor-type frames for signal processing on graphs,J. Fourier Anal. Appl.27(2) (2021) art. 25

    2021

  25. [33]

    K. Beck, M. Ghandehari, S. Hudson, J. Paltenstein, Frames for signal pro- cessing on Cayley graphs,J. Fourier Anal. Appl.30(2024) art. 66

    2024

  26. [34]

    Y. Chen, J. DeJong, T. Halverson, D. I. Shuman, Signal processing on the permutahedron: tight spectral frames for ranked data analysis,J. Fourier Anal. Appl.27(4) (2021) art. 70

    2021

  27. [35]

    I.Pesenson, SamplinginPaley–Wienerspacesoncombinatorialgraphs,Trans. Amer. Math. Soc.360(10) (2008) 5603–5627

    2008

  28. [36]

    S. Chen, R. Varma, A. Sandryhaila, J. Kovačević, Discrete signal processing on graphs: sampling theory,IEEE Trans. Signal Process.63(24) (2015) 6510– 6523

    2015

  29. [37]

    A. Anis, A. Gadde, A. Ortega, Efficient sampling set selection for bandlimited graph signals using graph spectral proxies,IEEE Trans. Signal Process.64 (14) (2016) 3775–3789

    2016

  30. [38]

    Perraudin, B

    N. Perraudin, B. Ricaud, D. I. Shuman, P. Vandergheynst, Global and lo- cal uncertainty principles for signals on graphs,APSIPA Trans. Signal Inf. Process.7(2018) e3

    2018

  31. [39]

    Stanković, E

    L. Stanković, E. Sejdić, M. Daković, Vertex-frequency energy distributions, IEEE Signal Process. Lett.25(3) (2018) 358–362

    2018

  32. [40]

    Meyer,Wavelets and Operators, Cambridge University Press, 1992

    Y. Meyer,Wavelets and Operators, Cambridge University Press, 1992

    1992

  33. [41]

    G. B. Folland,A Course in Abstract Harmonic Analysis, 2nd ed., CRC Press, 2016

    2016

  34. [42]

    Behjat, N

    H. Behjat, N. Leonardi, L. Sörnmo, D. Van De Ville, Anatomically-adapted graph wavelets for improved group-level fMRI activation mapping,NeuroIm- age123(2015) 185–199. 30

    2015

  35. [43]

    Rustamov, L

    R. Rustamov, L. J. Guibas, Wavelets on graphs via deep learning, in:Adv. Neural Inf. Process. Syst. (NeurIPS), 2013, pp. 998–1006

    2013

  36. [44]

    W. W. Zachary, An information flow model for conflict and fission in small groups,Journal of Anthropological Research33(4) (1977) 452–473. 31

    1977

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.