A Linear Cheeger Inequality using Eigenvector Norms

نویسنده

  • Franklin Kenter
چکیده

The Cheeger constant, hG, is a measure of expansion within a graph. The classical Cheeger Inequality states: λ1/2 ≤ hG ≤ √ 2λ1 where λ1 is the first nontrivial eigenvalue of the normalized Laplacian matrix. Hence, hG is tightly controlled by λ1 to within a quadratic factor. We give an alternative Cheeger Inequality where we consider the∞-norm of the corresponding eigenvector in addition to λ1. This inequality controls hG to within a linear factor of λ1 thereby providing an improvement to the previous quadratic bounds. An additional advantage of our result is that while the original Cheeger constant makes it clear that hG → 0 as λ1 → 0, our result shows that hG → 1/2 as λ1 → 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A linear k-fold Cheeger inequality

Abstract. Given an undirected graph G, the classical Cheeger constant, hG, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The wellknown Cheeger’s inequality states that 2λ1 ≤ hG ≤ √ 2λ1 where λ1 is the minimum nontrivial eigenvalue of the normalized Laplacian matrix. Recent work has generalized the concept of...

متن کامل

In Theory

The dimensionhypercube has and , giving an infinite family of graphs for which , showing that the first Cheeger inequality is exactly tight. The -cycle has , and , giving an infinite family of graphs for which , showing that the second Cheeger inequality is tight up to a constant. There is an eigenvector of the 2nd eigenvalue of the hypercube , such that the SpectralPartitioning algorithm, give...

متن کامل

Lecture 08 . RandomWalk on Graphs : Fiedler Vector , Cheeger inequality

In this class, we introduced the random walk on graphs. The last lecture shows Perron-Frobenius theory to the analysis of primary eigenvectors which is the stationary distribution. In this lecture we will study the second eigenvector. To analyze the properties of the graph, we construct two matrices: one is (unnormalized) graph Laplacian and the other is normalized graph Laplacian. In the first...

متن کامل

Cheeger Inequalities for Submodular Transformations

The Cheeger inequality for undirected graphs, which relates the conductance of an undirected graph and the second smallest eigenvalue of its normalized Laplacian, is a cornerstone of spectral graph theory. The Cheeger inequality has been extended to directed graphs and hypergraphs using normalized Laplacians for those, that are no longer linear but piecewise linear transformations. In this pape...

متن کامل

Linear programming on SS-fuzzy inequality constrained problems

In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family of continuous t-norms, which covers the whole spectrum of t-norms when the parameter is changed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1412.3195  شماره 

صفحات  -

تاریخ انتشار 2014