Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2403.10527

The Graph Fractional Fourier Transform in Hilbert Space

Yu Zhang·Bing-Zhao Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

Graph signal processing (GSP) leverages the inherent signal structure within graphs to extract high-dimensional data without relying on translation invariance. It has emerged as a crucial tool across multiple fields, including learning and processing of various networks, data analysis, and image processing. In this paper, we introduce the graph fractional Fourier transform in Hilbert space (HGFRFT), which provides additional fractional analysis tools for generalized GSP by extending Hilbert space and vertex domain Fourier analysis to fractional order. First, we establish that the proposed HGFRFT extends traditional GSP, accommodates graphs on continuous domains, and facilitates joint time-vertex domain transform while adhering to critical properties such as additivity, commutativity, and invertibility. Second, to process generalized graph signals in the fractional domain, we explore the theory behind filtering and sampling of signals in the fractional domain. Finally, our simulations and numerical experiments substantiate the advantages and enhancements yielded by the HGFRFT.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yu Zhang, Bing-Zhao Li. 2024-01-15. The Graph Fractional Fourier Transform in Hilbert Space. https://arxiv.org/abs/2403.10527

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗