We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering phenomenon deduced from metrics on real projective spaces. We further extend those results to a general reversible Markov operator and find applications in characterizing its essential spectrum
Let φ(G) be the minimum conductance of an undirected graph G, and let 0 = λ1 ≤ λ2 ≤... ≤ λn ≤ 2 be t...
We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary ...
28 pages, 6 figures.-- MSC2000 codes: 05C50, 05C70, 47A10.-- ArXiv pre-print available at: http://ar...
AbstractWe introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual...
Abstract. We introduce a set of multi-way dual Cheeger constants and prove universal higher-order du...
We discuss a Cheeger constant as a mixture of the frustration index and the expansion rate, and prov...
We discuss a Cheeger constant as a mixture of the frustration index and the expansion rate, and prov...
We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-d...
Abstract. In this article we study the top of the spectrum of the nor-malized Laplace operator on in...
A basic fact in spectral graph theory is that the number of connected components in an undirected gr...
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
The celebrated Cheeger's Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edg...
LNCS v.9188 entitled: Computing and Combinatorics: 21st International Conference, COCOON 2015, Beiji...
International audienceWe prove a lower bound for the k-th Steklov eigenvalues in terms of an isoperi...
Let φ(G) be the minimum conductance of an undirected graph G, and let 0 = λ1 ≤ λ2 ≤... ≤ λn ≤ 2 be t...
We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary ...
28 pages, 6 figures.-- MSC2000 codes: 05C50, 05C70, 47A10.-- ArXiv pre-print available at: http://ar...
AbstractWe introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual...
Abstract. We introduce a set of multi-way dual Cheeger constants and prove universal higher-order du...
We discuss a Cheeger constant as a mixture of the frustration index and the expansion rate, and prov...
We discuss a Cheeger constant as a mixture of the frustration index and the expansion rate, and prov...
We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-d...
Abstract. In this article we study the top of the spectrum of the nor-malized Laplace operator on in...
A basic fact in spectral graph theory is that the number of connected components in an undirected gr...
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
The celebrated Cheeger's Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edg...
LNCS v.9188 entitled: Computing and Combinatorics: 21st International Conference, COCOON 2015, Beiji...
International audienceWe prove a lower bound for the k-th Steklov eigenvalues in terms of an isoperi...
Let φ(G) be the minimum conductance of an undirected graph G, and let 0 = λ1 ≤ λ2 ≤... ≤ λn ≤ 2 be t...
We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary ...
28 pages, 6 figures.-- MSC2000 codes: 05C50, 05C70, 47A10.-- ArXiv pre-print available at: http://ar...