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 95 for “"Spectral graph theory"”.
-
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 …
-
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, …
-
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, …
-
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. …
-
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 …
-
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 …
-
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 …
-
Laplacians Of Cellular Sheaves: Theory And Applications
Cellular sheaves are a discrete model for the theory of sheaves on cell complexes. They carry a canonical cochain complex computing their cohomology. This thesis develops the theory of the Hodge Laplacians of this complex, as well as avenues for their application to concrete engineering and data …
-
Traffic congestion analysis for a software-defined network
… network. The method incorporates spectral graph theory and phantom node techniques. The experimental implementation of spectral graph theory used eigenvalue-eigenvector solutions to characterize a mathematical model of the network’s topology. In this thesis, we used the phantom …
-
The Characteristic Polynomial of the Laplacian Matrix of Certain Zero-Divisor Graphs
Spectral graph theory has started to gain popularity and usefulness in describing graphs using algebraic tools. Specifically the Laplacian matrix has been found to have rather nice eigenvalues with several applications to include the behavior of electricity, liquids, and Gaussian molecules. We …
-
Applications of Geometric and Spectral Methods in Graph Theory
Networks, or graphs, are useful for studying many things in today’s world. Graphs can be used to represent connections on social media, transportation networks, or even the internet. Because of this, it’s helpful to study graphs and learn what we can say about the structure of a given graph or what …
-
Complete Equitable Decompositions
A well-known result in spectral graph theory states that if a graph has an equitable partition then the eigenvalues of the associated divisor graph are a subset of the graph's eigenvalues. A natural question question is whether it is possible to recover the remaining eigenvalues of the graph. Here …
-
Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms
Graphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. …
-
Discrepancy Inequalities in Graphs and Their Applications
Spectral graph theory, which is the use of eigenvalues of matrices associated with graphs, is a modern technique that has expanded our understanding of graphs and their structure. A particularly useful tool in spectral graph theory is the Expander Mixing Lemma, also known as the discrepancy …
-
Contributions at the Interface Between Algebra and Graph Theory
… at the interface between algebra and graph theory. In Chapter 1, we give an overview of the topics and also the definitions and preliminaries. In Chapter 2, we estimate the number of possible types degree patterns of k-lacunary polynomials of degree t < p which split completely modulo …
-
Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix
<p>In discrete mathematics, a graph is a representation of relationships between objects. Using linear algebraic techniques, we can encode a graph into a matrix. However, as the graph grows, so too does the matrix. This leads to computational limitations and necessitates the development of …
-
Mean Eigenvalue Counting Function Bound for Laplacians on Random Networks
Spectral graph theory widely increases the interests in not only discovering new properties of well known graphs but also proving the well known properties for the new type of graphs. In fact all spectral properties of proverbial graphs are not acknowledged to us and in other hand due to the …
Page 1 of 5