Edge Expansion and Spectral Gap of Nonnegative Matrices

Abstract

The classic graphical Cheeger inequalities state that if M is an n× n symmetric doubly stochastic matrix, then \[ 1-λ2(M)2≤φ(M)≤2·(1-λ2(M)) \] where φ(M)=S⊂eq[n],|S|≤ n/2(1|S|Σi∈ S,j∈ SMi,j) is the edge expansion of M, and λ2(M) is the second largest eigenvalue of M. We study the relationship between φ(A) and the spectral gap 1-Reλ2(A) for any doubly stochastic matrix A (not necessarily symmetric), where λ2(A) is a nontrivial eigenvalue of A with maximum real part. Fiedler showed that the upper bound on φ(A) is unaffected, i.e., φ(A)≤2·(1-Reλ2(A)). With regards to the lower bound on φ(A), there are known constructions with \[ φ(A)∈(1-Reλ2(A) n), \] indicating that at least a mild dependence on n is necessary to lower bound φ(A). In our first result, we provide an exponentially better construction of n× n doubly stochastic matrices An, for which \[φ(An)≤1-Reλ2(An)n.\] In fact, all nontrivial eigenvalues of our matrices are 0, even though the matrices are highly nonexpanding. We further show that this bound is in the correct range (up to the exponent of n), by showing that for any doubly stochastic matrix A, \[φ(A)≥1-Reλ2(A)35· n.\] Our second result extends these bounds to general nonnegative matrices R, obtaining a two-sided quantitative refinement of the Perron-Frobenius theorem in which the edge expansion φ(R) (appropriately defined), a quantitative measure of the irreducibility of R, controls the gap between the Perron-Frobenius eigenvalue and the next-largest real part of any eigenvalue.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…