Results 11 to 20 of about 230,605 (276)

Spectral Theory of Infinite Quantum Graphs [PDF]

open access: yesAnnales Henri Poincaré, 2018
Dedicated to the memory of M. Z. Solomyak (16.05.1931 - 31.07.2016)
Pavel Exner   +3 more
openaire   +9 more sources

Wavelets on graphs via spectral graph theory

open access: yesApplied and Computational Harmonic Analysis, 2011
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian $Ł$.
Hammond, David K.   +2 more
openaire   +6 more sources

Spectrum and energy of the Sombor matrix [PDF]

open access: yesVojnotehnički Glasnik, 2021
Introduction/purpose: The Sombor matrix is a vertex-degree-based matrix associated with the Sombor index. The paper is concerned with the spectral properties of the Sombor matrix. Results: Equalities and inequalities for the eigenvalues of the Sombor
Ivan Gutman
doaj   +1 more source

Spectral recognition of graphs [PDF]

open access: yesYugoslav Journal of Operations Research, 2012
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are characterized by their spectra.
Cvetković Dragoš
doaj   +1 more source

A theory of spectral partitions of metric graphs [PDF]

open access: yes, 2020
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several notions of ...
Kennedy, James B.   +3 more
core   +2 more sources

A Short Text Clustering Algorithm Based on Spectral Cut [PDF]

open access: yesJisuanji gongcheng, 2016
Short text has the characteristics of sparsity and high dimension,and the existing clustering algorithm for the large-scale short text has low accuracy and efficiency.Aiming at this problem,a novel clustering method based on spectral clustering theory ...
LI Xiaohong,XIE Meng,MA Huifang,HE Tingnian
doaj   +1 more source

From Time–Frequency to Vertex–Frequency and Back

open access: yesMathematics, 2021
The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković   +5 more
doaj   +1 more source

Eigenvalues of multipart matrices and their applications

open access: yesThe American Journal of Combinatorics, 2023
A square matrix is called a multipart matrix if all its diagonal entries are zero and all other entries in each column are constant. In this paper, we describe various interesting spectral properties of multipart matrices. We provide suitable bounds for
Ranjit Mehatari
doaj   +1 more source

The Grone-Merris Conjecture [PDF]

open access: yes, 2010
In spectral graph theory, Grone and Merris conjecture that the spectrum of the Laplacian matrix of a finite graph is majorized by the conjugate degree sequence of this graph.
Bai, Hua
core   +2 more sources

Structure-function models of temporal, spatial, and spectral characteristics of non-invasive whole brain functional imaging

open access: yesFrontiers in Neuroscience, 2022
We review recent advances in using mathematical models of the relationship between the brain structure and function that capture features of brain dynamics. We argue the need for models that can jointly capture temporal, spatial, and spectral features of
Ashish Raj   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy