Eigenvalues of Graphs and Sobolev Inequalities

نویسندگان
چکیده

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

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

منابع مشابه

Eigenvalues of Graphs and Sobolev Inequalities

We derive bounds for eigenvalues of the Laplacian of graphs using the discrete versions of the Sobolev inequalities and heat kernel estimates.

متن کامل

Log-sobolev, Isoperimetry and Transport Inequalities on Graphs

In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...

متن کامل

Logarithmic Sobolev, Isoperimetry and Transport Inequalities on Graphs

In this paper, we study some functional inequalities (such as Poincaré inequality, logarithmic Sobolev inequality, generalized Cheeger isoperimetric inequality, transportation-information inequality and transportation-entropy inequality) for reversible nearest-neighbor Markov processes on connected finite graphs by means of (random) path method. We provide estimates of the involved constants.

متن کامل

Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs

5 Analysis on weighted graphs 23 5.1 Measures on graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 5.2 Discrete Laplacian . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 5.3 Green’s formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 5.4 Integration versus Summation . . . . . . . . . . . . . . . . . . . . . . ...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

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


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

ژورنال

عنوان ژورنال: Combinatorics, Probability and Computing

سال: 1995

ISSN: 0963-5483,1469-2163

DOI: 10.1017/s0963548300001449