5 papers
Nearly permanental cospectral graphs
Weifang Lv, Quanyu Tang, Wei Wang +1
Let be a simple graph of order with adjacency matrix . The \emph{determinant} and the \emph{permanen}t of the matrix are defined as \[\mathrm{det}A= \sum_{…
A Family of Simultaneously Cospectral Trees for Degree-Distance Matrices
Limeng Lin, Quanyu Tang, Kehua Wang +1
Spectral characterization of graphs for various graph matrices constitutes a central topic in spectral graph theory. Let be a graph with adjacency matrix , diagonal degre…
RAPAC-DP: Response-Aligned Pending-Action Compensation for Diffusion Policies under Delayed Execution
Tao Wang, Wei Wang, Jianhui Wang +3
Cloud-side inference gives imitation-learning policies access to greater computational resources, but communication and computation delays can degrade control performance. To compe…
On the Spectral Determination of Complements of \(T\)-shape Trees
Feifan Gong, Kehua Wang, Wei Wang
A graph \(G\) is said to be \emph{determined by its spectrum} if every graph cospectral with \(G\) is isomorphic to \(G\). A \emph{T-shape tree} is defined as a tree containing exa…
From LLM Inference to Agentic Workloads: Characterization and Implications for Serving Systems
Chaokun Chang, Yukun Zhou, Kaihua Fu +10
Agentic applications are shifting AI serving from isolated model inference to long-running workloads in which LLMs coordinate tools, environments, and persistent state. However, th…