Still some graphs are characterized by their spectra and several mathematical papers are devoted to this topic. In applications to computer sciences, spectral graph theory is considered as very strong. The benefit of using graph spectra in treating graphs is that eigenvalues and eigenvectors of ...
29]. A mesh can be represented as a graph, where vertices are mesh nodes and an edge connects any two vertices if they are part of the same mesh element. For both graph drawing and cache-efficient mesh processing, the goal is to minimize the distance between...
The concept of spectral submanifolds, a powerful method of model order reduction of nonlinear systems, is extended to time delay systems that have infinite
M Ghossoub,J Hall,D Saunders - 《Mathematics of Operations Research》 被引量: 0发表: 2023年 Numerical solution of the graph p-Laplacian partial eigen-problem In the last years the graph p-Laplacian eigenvalue problem has become central in applications related to machine learning, such as for...
First, the model converts a crystal structure into a graph with nodes representing atoms. The nodes are embedded with a one-hot-encoded vector of the constituent atoms' atomic number multiplied by the atomic mass. The edges, connecting atoms within a 4 Å; radius, embed the interatomic dist...
This work evaluates the performance of the Complex Master Slave (CMS) method, that processes the spectra at the interferometer output of a spectral domain interferometry device without involving Fourier transforms (FT) after data acquisition. Reliability
SC method is based on the graph theory and is insensitive to the structure of data. Many traditional clustering problems have been solved by it. Recently, SC method has successfully been implemented in many fields such as information searching [15], bioinformatics [16], and image segmentation [...
Spectral graph theory and applications in clustering and learning on manifolds Domain-specific aspects of using spectral approaches in applications Submitted papers should be in the ICML 2013 format with a maximum of 4 pages (not including references). Please e-mail your submission to spectralicml2013...
Springer for Research & Development doi:10.1007/s10801-015-0590-5The spectral excess theoremWeakly distance-regular digraphsDistance-regular digraphsNormal digraphs05C5005E30The spectral excess theorem, a remarkable result due to Fiol and Garriga, states that a connected regular graph with \\(d+1\\...
This novel method of extraction of quasi-spectra aims at a very challenging problem, which cannot be solved precisely even in theory: some information is irrecoverably lost. The method arises from very general assumptions on the measurement system. The method does not rely on any light-media inte...