Metraipolis › archive › dc_c23ec7fce76a

Signal-Aware Cayley Completion: Choosing Between an Exact and a Lossy Abelian Host — arXiv:2609.01523

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01523
License (as archived)
CC0-1.0
Archived
2026-10-17T07:33:50.209Z
SHA-256 of the archived text
c0ae8c3f2cd9ee88f065d8eaefd06f6718ff6deacd98c7c5e9d21512161837bc
Stable URL of this page
https://metraipolis.com/documento/dc_c23ec7fce76a

How to cite

Signal-Aware Cayley Completion: Choosing Between an Exact and a Lossy Abelian Host — arXiv:2609.01523 — arXiv (en), https://arxiv.org/abs/2609.01523 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c23ec7fce76a (Metraipolis archive dc_c23ec7fce76a, sha256 c0ae8c3f2cd9ee88f065d8eaefd06f6718ff6deacd98c7c5e9d21512161837bc)
BibTeX
@misc{dcc23ec7fce76a,
  title = {Signal-Aware Cayley Completion: Choosing Between an Exact and a Lossy Abelian Host — arXiv:2609.01523},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01523},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c23ec7fce76a; sha256 c0ae8c3f2cd9ee88f065d8eaefd06f6718ff6deacd98c7c5e9d21512161837bc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01523. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Group-embedding graph signal processing buys exact Fourier analysis either by enlarging the domain until a graph embeds isometrically into an abelian Cayley graph, or by perturbing the graph until it is one. We give a linear-time procedure that chooses between the two, and study the criterion governing the lossy branch. We prove that the perturbation of the Dirichlet form is exactly the signed sum of the edited-edge energies, and is bounded in modulus by their total, into which the combinatorial cost of the completion does not enter. We confirm experimentally that this energy predicts signal fidelity strongly though not strictly monotonically (Spearman rho = -0.79 on an instance where the completion, and hence the cost, is held fixed), while the cost itself carries no information about it. Selecting among completions of identical cost by this energy recovers 61 percent of the available performance gap on the exhaustive range, on a sample too small to establish that the effect persists beyond eight vertices. On real payment data the router takes the exact branch everywhere; on real anti-money-laundering data the completion invariant is a re-encoding of maximum degree and is not distinguishable from it, and the linear-time bound it rivals is shown to have a blind spot on near-complete graphs.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-02 in eess.SP).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.01523 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T07:23:24.232Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).