Upper Bounds for Eigenvalues of the Discrete and Continuous Laplace Operators

@article{Chung1996UpperBF,
  title={Upper Bounds for Eigenvalues of the Discrete and Continuous Laplace Operators},
  author={Fan R. K. Chung and Alexander Grigor’yan and Shing-Tung Yau},
  journal={Advances in Mathematics},
  year={1996},
  volume={117},
  pages={165-178}
}
In this paper, we are concerned with upper bounds of eigenvalues of Laplace operator on compact Riemannian manifolds and finite graphs. While on the former the Laplace operator is generated by the Riemannian metric, on the latter it reflects combinatorial structure of a graph. Respectively, eigenvalues have many applications in geometry as well as in combinatorics and in other fields of mathematics. We develop a universal approach to upper bounds on both continuous and discrete structures based… 

Eigenvalues of elliptic operators and geometric applications

The purpose of this talk is to present a certain method of obtaining upper estimates of eigenvalues of Schrodinger type operators on Riemannian manifolds, which was introduced in the paper Grigor’yan

Some New Results on Eigenvectors via Dimension, Diameter, and Ricci Curvature☆

Abstract We generalise for a general symmetric elliptic operator the different notions of dimension, diameter, and Ricci curvature, which coincide with the usual notions in the case of the

Laplacian Eigenvalues and Distances Between Subsets of a Manifold

In this paper we give a new method to convert results dealing with graph theoretic (or Markov chain) Laplacians into results concerning Laplacians in analysis, such as on Riemannian manifolds. We

Large eigenvalues and concentration

Let M n D.M; g/ be a compact, connected, Riemannian manifold of dimension n. Let be the measure D dvolg, where 2 C 1 .M/ is a nonnegative density. We first show that, under some mild metric

Eigenvalues and diameters for manifolds and graphs

In this paper, we develop a universal approach for estimating from above the eigenvalues of the Laplace operator on the underlying spaces of different kinds: on compact or finite volume Riemannian

Inverse problems for discrete heat equations and random walks

We study the inverse problem of determining a finite weighted graph (X,E) from the source-to-solution map on a vertex subset B ⊂ X for heat equations on graphs, where the time variable can be either

Upper bounds for higher-order Poincaré constants

Here we introduce higher-order Poincaré constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted

Discrete harmonic maps and convergence to conformal maps, I: Combinatorial harmonic coordinates

In this paper, we provide new discrete uniformization theorems for bounded, mconnected planar domains. To this end, we consider a planar, bounded, m-connected domain , and let @ be its boundary.

Eigenvalues of Laplacian and multi-way isoperimetric constants on weighted Riemannian manifolds

We investigate the distribution of eigenvalues of the weighted Laplacian on closed weighted Riemannian manifolds of nonnegative Bakry-\'Emery Ricci curvature. We derive some universal inequalities

BOUNDARY VALUE PROBLEMS ON PLANAR GRAPHS AND FLAT SURFACES WITH INTEGER CONE SINGULARITIES , II : THE MIXED DIRICHLET-NEUMANN

In this paper we continue the study started in [16]. We consider a planar, bounded, m-connected region Ω, and let ∂Ω be its boundary. Let T be a cellular decomposition of Ω∪∂Ω, where each 2-cell is
...

References

SHOWING 1-10 OF 10 REFERENCES

Eigenvalues and diameters for manifolds and graphs

In this paper, we develop a universal approach for estimating from above the eigenvalues of the Laplace operator on the underlying spaces of different kinds: on compact or finite volume Riemannian

Diameters and eigenvalues

We derive a new upper bound for the diameter of a k-regular graph G as a function of the eigenvalues of the adjacency matrix. Namely, suppose the adjacency matrix of G has eigenvalues AI, A2,)A,,

Isoperimetric Inequalities and Eigenvalues

TLDR
An upper bound is given on the minimum distance between i subsets of same size of a regular graph in terms of the ith largest eigenvalue in absolute value for any integer i, and bounds are shown to be asymptotically tight for explicit families of graphs having an asymPTotically optimal ithlargest eigen value.

il , , lsoperimetric Inequalities for Graphs , and Superconcentrators

A general method for obtaining asymptotic isoperimetric inequalities for families of graphs is developed. Some of these inequalities have been applied to functional analysis, This method uses the

On the parabolic kernel of the Schrödinger operator

Etude des equations paraboliques du type (Δ−q/x,t)−∂/∂t)u(x,t)=0 sur une variete riemannienne generale. Introduction. Estimations de gradients. Inegalites de Harnack. Majorations et minorations des

An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian

TLDR
The authors give a new upper bound for the diameter $D(G)$ of a graph $G$ in terms of the eigenvalue of the Laplacian of $G$, where $\lfloor \rfloor$ is the floor function.

Integral maximum principle and its applications

  • A. Grigor’yan
  • Mathematics
    Proceedings of the Royal Society of Edinburgh: Section A Mathematics
  • 1994
The integral maximum principle for the heat equation on a Riemannian manifold is improved and applied to obtain estimates of double integrals of the heat kernel.

Explicit Concentrators from Generalized N-Gons

Concentrators are graphs used in the construction of switching networks that exhibit high connectivity. A technique for establishing the concentration properties of a graph by analysis of its eigen...

Spectral Graph Theory, CBMS Lecture Notes, AMS publication

  • Spectral Graph Theory, CBMS Lecture Notes, AMS publication
  • 1995