Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 133 for “"spectral graph"”.

  1. Spectral graph theory of the Hypercube

    In Graph Theory, every graph can be expressed in terms of certain real, symmetric matrices derived from the graph, most notably the adjacency or Laplacian matrices. Spectral Graph Theory focuses on the set of eigenvalues and eigenvectors, called the spectrum, of these matrices and provides several …

    nps Repository record for Spectral graph theory of the Hypercube (opens in a new tab)

  2. Theoretical Analysis of Spectral Graph Neural Networks

    Spectral Graph Neural Networks (GNNs) have demonstrated strong performance in graph node classification tasks, yet factors affecting their performance remains insufficiently understood. We provide theoretical analysis of factors affecting the performance of spectral GNNs in node classification …

    anu Repository record for Theoretical Analysis of Spectral Graph Neural Networks (opens in a new tab)

  3. Properties and Recent Applications in Spectral Graph Theory

    … applications of mathematics, specifically spectral graph theory, within the sciences and many other fields. This paper is an exploration of recent applications of spectral graph theory, including the fields of chemistry, biology, and graph coloring. Topics such as the isomers of alkanes, …

    vcu Repository record for Properties and Recent Applications in Spectral Graph Theory (opens in a new tab)

  4. Spectral graph theory with applications to quantum adiabatic optimization

    … between quantum adiabatic optimization, spectral graph theory, heat-diffusion, and sub-stochastic processes through the operators that govern these processes and their associated spectra. In particular, we study Hamiltonians which have recently become known as ``stoquastic'' or, …

    maryland Repository record for Spectral graph theory with applications to quantum adiabatic optimization (opens in a new tab)

  5. Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering

    … involve the study of statistical inference on graphs. Our problem of interest is to cluster the vertices of a graph by identifying its underlying community structure. Among various vertex clustering approaches, spectral clustering is one of the most popular clustering methods because it is easy …

    jhu Repository record for Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering (opens in a new tab)

  6. Segmentation and classification of polarimetric SAR data using spectral graph partitioning

    … cue. The pair-wise grouping technique of Spectral Graph Partitioning (SGP) is employed to perform the segmentation and classification tasks based on graph cuts. A new classification algorithm is developed for POLSAR data, where segmentation based on the contour and spatial proximity cues …

    ubc Repository record for Segmentation and classification of polarimetric SAR data using spectral graph partitioning (opens in a new tab) Download PDF for Segmentation and classification of polarimetric SAR data using spectral graph partitioning (opens in a new tab)

  7. SPECTRAL GRAPH-BASED CYBER DETECTION AND CLASSIFICATION SYSTEM WITH PHANTOM COMPONENTS

    … to provide network protection. We propose a spectral graph-based cyber detection and classification (SGCDC) system using phantom components, the strong node concept, and the dual-degree matrix to detect, classify, and respond to worm and distributed denial-of-service (DDoS) attacks. The …

    nps Repository record for SPECTRAL GRAPH-BASED CYBER DETECTION AND CLASSIFICATION SYSTEM WITH PHANTOM COMPONENTS (opens in a new tab)

  8. Spectral graph features for improved object level place recognition in dynamic environments

    … method for object-level place recognition called Spectral Graph Place Recognition (SGPR). This method matches point cloud object-instances between scenes using geometrically encoded spectral features. These spectral features are calculated through a novel Minimally Connected Adaptive Radius …

    colo-mines Repository record for Spectral graph features for improved object level place recognition in dynamic environments (opens in a new tab)

  9. Software defined network monitoring scheme using spectral graph theory and phantom nodes

    … derived from the dual basis concept of the graph theory are used to monitor changes in a network. The proposed scheme uses a phantom node and the concept of a reference node to determine changes in these metrics in order to identify disconnected, congested, underutilized, and attacked nodes. …

    nps Repository record for Software defined network monitoring scheme using spectral graph theory and phantom nodes (opens in a new tab)

  10. Spectral graph theory analysis of software-defined networks to improve performance and security

    … is based on the eigendecomposition of a weighted graph that accounts for the network topology and traffic load. A software-defined network closed-loop control scheme is developed; the scheme is modeled after a closed-loop control system that includes an observer and a controller. A particle filter …

    nps Repository record for Spectral graph theory analysis of software-defined networks to improve performance and security (opens in a new tab)

  11. Advancements in Combinatorial Optimization and Spectral Graph Theory: Approaches to Permanents, Metric Embeddings, and Geometric Graphs

    … I will cover my results on planar and geometric graphs. Namely, in the papers ``On planar graphs of uniform polynomial growth'' and ``Non-existence of annular separators in geometric graphs'' we resolve several conjectures and open problems about spectral properties of a certain family of …

    washington Repository record for Advancements in Combinatorial Optimization and Spectral Graph Theory: Approaches to Permanents, Metric Embeddings, and Geometric Graphs (opens in a new tab)

  12. Spectra of Hypergraphs

    We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A number of developments building upon classical work has led to a rich understanding of 'symmetric hyperdeterminants' of hypermatrices, a.k.a. multidimensional arrays. Symmetric hyperdeterminants …

    south-carolina Repository record for Spectra of Hypergraphs (opens in a new tab)

  13. HIGH-PERFORMANCE SPECTRAL METHODS FOR COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS

    Recent research shows that by leveraging the key spectral properties of eigenvalues and eigenvectors of graph Laplacians, more efficient algorithms can be developed for tackling many graph-related computing tasks. In this dissertation, spectral methods are utilized for achieving faster algorithms …

    mtu Repository record for HIGH-PERFORMANCE SPECTRAL METHODS FOR COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS (opens in a new tab)

  14. Expedition in Data and Harmonic Analysis on Graphs

    The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and …

    maryland Repository record for Expedition in Data and Harmonic Analysis on Graphs (opens in a new tab)

  15. Laplacians Of Cellular Sheaves: Theory And Applications

    … so developed are a vast generalization of the graph Laplacians studied in spectral graph theory. As such, they admit generalizations of many results from spectral graph theory and the spectral theory of discrete Hodge Laplacians. A theory of approximation of cellular sheaves is developed, and …

    penn Repository record for Laplacians Of Cellular Sheaves: Theory And Applications (opens in a new tab)

  16. Spectral Descriptors for Data Clustering and Classification

    Spectral descriptors have received much attention in recent years due in large part to their versatility as well as their ability to capture either local or global geometric information of data. While the overwhelming majority of work on spectral descriptors has concentrated primarily on …

    concordia Download PDF for Spectral Descriptors for Data Clustering and Classification (opens in a new tab)

Page 1 of 7