Spectral Graph Uncertainty Principles via the Graph Fractional Fourier Transform

Yu Zhang; Bing-Zhao Li

Home/Archive/arXiv

arXiv · 2607.06574

Spectral Graph Uncertainty Principles via the Graph Fractional Fourier Transform

Yu Zhang·Bing-Zhao Li

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper develops a graph fractional uncertainty principle in the graph fractional Fourier transform (GFRFT) domain. We introduce localization operators in the vertex domain and the graph fractional spectral domain, and build an operator framework to characterize the joint localization of graph signals. A sandwiched joint localization operator is first constructed, whose largest eigenvalue quantifies the attainable simultaneous concentration in the two domains. Then, rotated localization operators and the numerical range are used to provide a geometric description of the admissible uncertainty region, together with a polygonal approximation method for its computation. Numerical examples show that the fractional order reshapes the vertex-graph fractional spectral localization trade-off, and enlarge or shrink the uncertainty region relative to the graph Fourier transform based case. These results generalize classical graph uncertainty principles to the GFRFT domain and provide a flexible tool for graph fractional signal analysis and graph-adapted localized representations.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Yu Zhang, Bing-Zhao Li. 2026-07-02. Spectral Graph Uncertainty Principles via the Graph Fractional Fourier Transform. https://arxiv.org/abs/2607.06574

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

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

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↗