Discrete random electromagnetic Laplacians
نویسنده
چکیده
We consider discrete random magnetic Laplacians in the plane and discrete random electromagnetic Laplacians in higher dimensions. The existence of these objects relies on a theorem of Feldman-Moore which was generalized by Lind to the nonabelian case. For example, it allows to realize ergodic Schrr odinger operators with stationary independent magnetic elds on discrete two dimensional lattices including also nonperiodic situations like Penrose lattices. The theorem is generalized here to higher dimensions. The Laplacians obtained from the electromagnetic vector potential are elements of a von Neumann algebra constructed from the underlying dynamical system respectively from the ergodic equivalence relation. They generalize Harper operators which correspond to constant magnetic elds. For independent identically distributed magnetic elds and special Anderson models, we compute the density of states using a random walk expansion. cohomology of ergodic Z d actions, ergodic equivalence relations.
منابع مشابه
Discrete Green’s functions for products of regular graphs
Discrete Green’s functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green’s functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, and 3-dimensional torus, as is an inductive formula for the t-dimensional toru...
متن کاملSpectral convergence of the connection Laplacian from random samples
Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as DiffusionMaps and Laplacian Eigenmaps, are often used for manifold learning and nonlinear dimensionality reduction. It was previously shown by Belkin&Niyogi (2007, Convergence of Laplacian eigenmaps, vol. 19. Proceedings of the 2006 Conference on Advances in Neural Information Processing System...
متن کاملHigh-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کاملLaplacians for flow networks
We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut.
متن کاملNoisy random graphs and their Laplacians
Spectra and representations of some special weighted graphs are investigated with weight matrices consisting of homogeneous blocks. It is proved that a random perturbation of the weight matrix or that of the weighted Laplacian with a “Wignernoise” will not have an effect on the order of the protruding eigenvalues and the representatives of the vertices will unveil the underlying block-structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995