Papers
Topics
Authors
Recent
Search
2000 character limit reached

Laplacians on periodic discrete graphs

Published 29 Jan 2013 in math.SP, math-ph, and math.MP | (1301.6896v1)

Abstract: We consider Laplacians on $\Z2$-periodic discrete graphs. The following results are obtained: 1) The Floquet-Bloch decomposition is constructed and basic properties are derived. 2) The estimates of the Lebesgue measure of the spectrum in terms of geometric parameters of the graph are obtained. 3) The spectrum of the Laplacian is described, when the so-called fundamental graph consists of one or two vertices and any number of edges. 4) We consider the hexagonal lattice perturbed by adding one edge to the fundamental graph. There exist two cases: a) if the perturbed hexagonal lattice is bipartite, then the spectrum of the perturbed Laplacian coincides with the spectrum $[-1,1]$ for the unperturbed case, b) if the perturbed hexagonal lattice is not bipartite, then there is a gap in the spectrum of the perturbed Laplacian. Moreover, some deeper results are obtained for the perturbation of the square lattice.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.