R. Brooks, The spectral geometry of k-regular graphs, J. Anal. Math. 57 (1991) 120-151.R. Brooks, The spectral geometry of k-regular graphs, J. Anal. Math. 57 (1991), 120-151.R. Brooks, The spectral geometry of k-regular graphs, to appear in J. d'Analyse....
37 A case study on stochastic games on large graphs in mean field and sparse regime 48:17 Differential Equations and Algebraic Geometry - 2 58:18 Differential Equations and Algebraic Geometry - 3 53:48 Differential Equations and Algebraic Geometry - 4 53:46 Graphon spectral decompositions for ...
Trace-formula methods in the spectral geometry of graphs This book deals with the asymptotic developments of the heat trace and the heat content of operators of Laplace type acting on a smooth compact manifold, a... Quenell 被引量: 1发表: 1992年 Trace formula in noncommutative geometry and ...
Spectral geometrySteklov problemHypersurfaces of revolutionSharp upper boundsWe investigate the question of sharp upper bounds for the Steklov eigenvalues of a ... L Tschanz - 《Annales Mathématiques Du Québec》 被引量: 0发表: 2024年 The Steklov Problem on Triangle-Tiling Graphs in the Hyperboli...
Thus, the spectral properties of the adjacency matrix and the Laplacian can be analyzed by means of the elaborated theory of Jacobi matrices. For some examples which include antitrees, we derive the decomposition explicitly and present a zoo of spectral behavior induced by the geometry of the ...
Quantum graphs II. Some spectral properties of quantum and combinatorial graphs - Kuchment () Citation Context ... holds in the more general situation of manifolds of bounded geometry (in particular, on coverings of compact manifolds) [81]. An analogous theorem holds for periodic combinatorial ...
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of Laplacians on combinatorial and quantum graph in terms of the edge connectivity, i.e. the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the...
By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using Lp Wasserstein distances between probability measures, we define the corresponding spectral distances dp on the set of all graphs. This approach can even be extended to measuring the distances betw...
Working directly with such graphs is difficult, and it has be- come common to use spectral techniques that embed graphs in a geometry, and then work with the geometry instead. In a good embedding, edges that are heavily (positively) weighted, and so represent strong interactions, cause the ...
the Anderson model and other random media; non-self-adjoint matrices and operators, including Toeplitz operators; spectral geometry, including manifolds and automorphic forms; linear and nonlinear differential operators, especially those arising in geometry and physics; orthogonal polynomials; inverse problems...