Trace of Multi-variable Matrix Functions and its Application to Functions of Graph Spectrum

Abstract

Matrix extension of a scalar function of a single variable is well-studied in literature. Of particular interest is the trace of such functions. It is known that for diagonalizable matrices, M, the function g(M) = Tr(f(M)) = Σj=1n f(μj) (where \μj\j=1,2,·s,n are the eigenvalues of M) inherits the monotonocity and convexity properties of f (i.e., for g to be convex, f need not be operator convex -- convexity is sufficient). In this paper we formalize the idea of matrix extension of a function of multiple variables, study the monotonicity and convexity properties of the trace, and thus show that a function of form g(M) = Σj1=1n Σj2=1n ·s Σjm=1n f(μj1, μj2,·s, μjm) also inherits the monotonocity and convexity properties of the multi-variable function, f. We apply these results to functions of the spectrum of the weighted Laplacian matrix of undirected, simple graphs.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…