Sökning: "adjacency matrix"

Visar resultat 1 - 5 av 12 uppsatser innehållade orden adjacency matrix.

1. 1. Cospectral graphs : What properties are determined by the spectrum of a graph?

   Kandidat-uppsats, Uppsala universitet/Sannolikhetsteori och kombinatorik

   Författare :Erik Sundström; [2023]
   Nyckelord :graph theory; graph; graphs; spectral graph theory; cospectral graphs; adjacency matrix; adjacency matrices; graph spectrum; spectrum; graph spectra; spectra;

   Sammanfattning : This paper was written as a bachelor thesis in mathematics. We study adjacency matrices and their eigenvalues to investigate what properties of the corresponding graphs can be determined by those eigenvalues, the spectrum of the graph. The question of which graphs are uniquely determined by their spectra is also covered. LÄS MER

3. 2. A Continuous-time ODE Framework to Centrality in Dynamic Networks

   Kandidat-uppsats, Lunds universitet/Matematikcentrum; Lunds universitet/Matematik (naturvetenskapliga fakulteten)

   Författare :Francisco Garcia Atienza; [2023]
   Nyckelord :networks; centrality; continuous-time; matrix logarithm; ode framework; katz; resolvent; Mathematics and Statistics;

   Sammanfattning : The present study discusses and evaluates a novel continuous-time approach to network centrality, a fundamental concept in network analysis. Static methods based on discrete snapshots or time slices for measuring node interaction in networks that change over time do not fully capture the dynamical nature of network evolution. LÄS MER

4. 3. Graph Neural Network for Traffic Flow Forecasting : Does an enriched adjacency matrix with low dimensional dataenhance the performance of GNN for traffic flow forecasting?

   Uppsats för yrkesexamina på avancerad nivå, Högskolan i Halmstad/Akademin för informationsteknologi

   Författare :Fredrik Kortetjärvi; Rohullah Khorami; [2023]
   Nyckelord :Graph Neural Network;

   Sammanfattning : Nowadays, machine learning methods are used in many applications and deployed in manyelectronic devices to solve problems and predict future states. One of the challenges mostbig cities confront is traffic jams since the roads are crammed with more and more vehicles, which will easily cause traffic congestion. LÄS MER

5. 4. Synthetic Graph Generation at Scale : A novel framework for generating large graphs using clustering, generative models and node embeddings

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Johan Hammarstedt; [2022]
   Nyckelord :Data Anonymization; Graph Learning; Generative Graph Modeling; Graph Clustering; Node Embedding; Synthetic Data; Dataanonymisering; Grafinlärning; Generativa graf-modeller; Graf klustring; Länk prediktion; Nodinbäddning; Syntetisk data;

   Sammanfattning : The field of generative graph models has seen increased popularity during recent years as it allows us to model the underlying distribution of a network and thus recreate it. From allowing anonymization of sensitive information in social networks to data augmentation of rare diseases in the brain, the ability to generate synthetic data has multiple applications in various domains. LÄS MER

7. 5. A graph representation of event intervals for efficient clustering and classification

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Zed Heeje Lee; [2020]
   Nyckelord :event intervals; bipartite graph; spectral embedding; clustering; classification; händelsesintervall; bipartitgraf; spektral inbäddning; klustering; klassificering;

   Sammanfattning : Sequences of event intervals occur in several application domains, while their inherent complexity hinders scalable solutions to tasks such as clustering and classification. In this thesis, we propose a novel spectral embedding representation of event interval sequences that relies on bipartite graphs. LÄS MER